Volume :3 , Issue :1 ,Page :15-22

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 duplic ate graph withrespect to complementation D c *(G) of G is the graph whose vertex set is V(G)  V  (G) and edge set is E(G)  E(D(  G)) where D(  G) is the duplicate graph of the complement  G of G. In this paper, bounds for the domination number of D c *(G) are obtained. Also, relationships between the domination number of D c *(G) and other domination parameters are discussed.