• THE NUMBER OF MINIMUM CO – ISOLATED LOCATING DOMINATING SETS OF CYCLES
S. Muthammai, N. Meenal · International Journal of Mathematical Archive · 2015
L et G (V, E) be a simple, finite, undirected connected graph. A non – empty set S I V of a graph G is a dominating set, if every vertex in V – S is adjacent to atleast one vertex in S. A dominating set S I V is called a locating dominating set, if for any two vertices v, w I V – S, N(v) C S ¹ N(w) C S. A locating dominating set S I V is called a co – isolated locating dominating set, if there exists atleast one isolated vertex in . The co – isolated locating domination number g cild is the minimum cardinality of a co – isolated locating dominating set. The number of minimum co – isolated locating dominating sets in a graph G is denoted by g Dcild (G). In this paper, the number g Dcild is obtained for a Path P n , where n 3.