Abstract
The distance 2-resolving dominating set is the combination of two concepts, the resolving set and the distance 2-dominating set. The distance 2-resolving dominating set is a set that is both a distance 2-dominating set and a resolving set. The distance 2-resolving domination number is the minimum cardinality of a distance 2-resolving dominating set, denoted by γल2 (G). In this study, we define the distance 2-resolving dominating sets, and we examine distance 2- resolving domination number of graphs. We give the exact value of the distance 2-resolving domination number of complete graph, star graph, friendship graph and path graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
