On the resolving strong domination number of graphs: a new notion
Dafik Dafik, Slamin Slamin, Ika Hesti Agustin, Dwi Agustin Retnowardani, Elsa Yuli Kurniawati · Journal of Physics Conference Series · 2021
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.