Open AccessOn the resolving strong domination number of graphs: a new notion
Author(s) -
Dafik Dafik,
. Slamin,
Ika Hesti Agustin,
Dwi Agustin Retnowardani,
Elsa Yuli Kurniawati
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1836/1/012019
Subject(s) - domination analysis , vertex (graph theory) , dominating set , mathematics , combinatorics , graph , metric dimension , dimension (graph theory) , set (abstract data type) , discrete mathematics , computer science , line graph , pathwidth , programming language
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.