• THE NUMBER OF MINIMUM CO – ISOLATED LOCATING DOMINATING SETS OF CYCLES

S. MUTHAMMAI, N. MEENAL*

Abstract


Let G (V, E) be a simple, finite, undirected connected graph. A non – empty set   S Í 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 Í V is called a locating dominating set, if for any two vertices v, w Î V – S, N(v) Ç S ¹ N(w) Ç S. A locating dominating set S  Í V is called a co – isolated locating dominating set, if there exists atleast one  isolated vertex in <V – S >. The co – isolated locating domination number gcild is the minimum cardinality of a co – isolated locating dominating set.  gDcild is the number of minimum.....

Keywords


Dominating set, locating dominating set, co – isolated locating dominating set, co – isolated locating dominating number.

Full Text:

pdf

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2011-2019 Research Journal of Pure Algebra (RJPA)
Copyright Agreement & Authorship Responsibility
HTML Counter
Counter