Author:
Dafik ,Slamin ,Agustin Ika Hesti,Retnowardani Dwi Agustin,Kurniawati Elsa Yuli
Abstract
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.
Subject
General Physics and Astronomy
Reference13 articles.
1. Bounds on the strong domination number;Discrete Mathematics
2. The locating dominating set (LDS) of generalized of corona product of path graph and any graphs;Wardani;Journal of Physics: Conference Series,2020
3. A study of local domination number of S n H graph;Dafik;Journal of Physics: Conference Series,2018
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On resolving strong domination number of several graph classes;5th INTERNATIONAL CONFERENCE ON CURRENT SCENARIO IN PURE AND APPLIED MATHEMATICS (ICCSPAM-2022);2023
2. On Resolving Efficient Dominating Set of Cycle and Comb Product Graph;Proceedings of the 6th International Conference on Combinatorics, Graph Theory, and Network Topology (ICCGANT 2022);2023