Abstract
A set S ⊆ V (G) of an undirected graph G is a locating-dominating set of G if for each v ∈ V (G) \ S, there exists w ∈ S such tha vw ∈ E(G) and NG(x) ∩ S ̸= NG(y) ∩ S for any two distinct vertices x and y in V (G) \ S. S is a stable locating-dominating set of G if it is a locating-dominating set of G and S \ {v} is a locating-dominating set of G for each v ∈ S. The minimum cardinality of a stable locating-dominating set of G, denoted by γSLD(G), is called the stable locating-domination number of G. In this paper, we investigate this concept and the corresponding parameter for edge corona and lexicographic product of graphs.
Published Version (
Free)
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.
