Volume :1 , Issue :4 ,Page :158-169

Abstract : For a graph G, let V(G) and E(G) denote its vertex set and edge set respectively. Let V  (G) = {v  : v  V(G)} be a copy of V(G). The Super duplicate grap h D*(G) of G is the graph whose vertex set is V(G)  V  (G) and edge set is E(  G)  {u  v, uv  : uv  V(G)}, where  G is the complement of G. In this paper, some basic properties of D*(G) are studie d. Also a criterion for D*(G) to be Eulerian and a sufficient condition for Hamiltonicity are obtained. Fi nally, the parameters girth, connectivity, covering number, independence number, chromatic number, domination number and neighborhood number are determined for su per duplicate graphs.