Abstract
An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every vertex u ϵ V(G) — D is adjacent to some vertex v ϵ D. A set S of vertices in a graph G is an independent dominating set of G if D is an independent set and every vertex not in D is adjacent to a vertex in D. By locating independent dominating set of graph G, we mean that an independent dominating set D of G with the additional properties that for u,v ϵ (V — D) satisfies N(u) ∩ D ≠ N (v) ∩ D. A minimum locating independent dominating set is a locating independent dominating set of smallest possible size for a given graph G. This size is called the locating independent dominating number of G and denoted γLi(G). In this paper, we analyze the locating independent domination number of graph operations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
