Abstract
Dominating set of graph G is subset D⊆V(G) which for every vertex v∈V(G)\D those vertices has neighbour in D. If for every pairs of vertice x and y their neighbour set different than we called D locating-dominating set. As for the minimum cardinality of possible dominating set of G is called the locating-dominating number of G. We determine the value of the locating-dominating number for comb product path (Pn) and cycle (Cn) graph.
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.
