Abstract
The study of metric dimension of graph G has widely given some results and contribution of graph research of interest, including the domination set theory. The dominating set theory has been quickly growing and there are a lot of natural extension of this study, such as vertex domination, edge domination, total domination, power domination as well as the strong domination. In this study, we initiate to combine the two above concepts, namely metric dimension and strong domination set. Thus we have a resolving strong domination set. We have obtained the resolving strong domination number, denoted by γrst(G), of some graphs.
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.
