Volume :9 , Issue :1 ,Page :1-11

Abstract :A subset D of the vertex set V(G) of a graph G is said to be a dominating set if every vertex not in D is adjacent to at least one vertex in D. A dominating set D is said to be an eccentric dominating set if for every vVD, there exists at least one eccentric vertex of v in D. Let p  4 be a positive integer. The circulant graph Cp1, 2 is the graph with vertex set {v0, v1, v2, ..., vp-1} and edge set {{vi, vi+j}: i{0, 1, 2, ..., p1} and j{1, 2}}. In this paper, we initiate the study of domination number, eccentric domination number and restrained eccentric domination number in the circulant graphs Cp1, 2.