Volume :6 , Issue :4 ,Page :114-118

Abstract :In a graph G = (V, E), a set D  V(G) is an eccentric domina ting set if D is a dominating set of G and for every v  V  D, there exists at least one eccent ric point of v in D. The minimum cardinality of eccentric dominating set is called th e eccentric domination number and is denoted by  ed (G). In this paper, we determine the number of minimum eccentric dominating sets in paths.