Abstract:
For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V − S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set in G. A dominating set is aγ -set in G if |S = γ(G)|. A gamma graph γ.G of a garph G is a graph with S as a vertex set, if S1 S2 are adjacent if there exist two vertices u and v of G suchthat. In this paper we initiate the study of gamma graph of cycle C3k+1
