Volume :6 , Issue :4 ,Page :119-134

Abstract :A Set S  V(G) is a co-eccentric eccentric dominating set if S is a dominating set and for every vertex v  V  S, there exists at least one eccentric vertex of v in S and another eccentric vertex of v in V  S. The minimum cardinality of a co-eccentric e ccentric dominating set is called the co-eccentric eccentric domination number and is denoted by  cee (G). In this paper we present several bounds on the co-eccentric eccentric domination numb er, characterize graphs for which  cee (G) = 2 and find exact values of  cee (G) for some particular classes of graphs.