*Computer Science and Engineering Department Assam down town University, Assam, India
**Department of Computer Applications, Assam Engineering College, Gauhati University, Assam, India
Online published on 11 November, 2013.
In this paper, some properties and theoretical results of the Euler Graph G(2n+10, 4n+20) for n ≥1, obtained from a special pattern of Euler Diagrams have been studied. In addition to this the various properties related to the dual graph H(2n+12, 4n+20) and the intersection graph G/(2n+11, 2n+18) of the graph G(2n+10, 4n+20) for n ≥1, have also been focused.
Euler diagram, Euler graph, Intersection graph, Dual graph, Colorability
