Volume :3 , Issue :4 ,Page :185-190

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 point of v in D. The minimum of the cardin alities of the eccentric dominating sets of G is called the eccentric domination number  ed (G) of G. In this paper, some new bounds for eccentric domination number of a graph is studied.