Abstract
This study aims to analyse the resolving strong dominating set. This concept combinations of two notions, they are metric dimension and strong domination set. By a resolving strong domination set, we mean a set Ds ⊂ V(G) which satisfies the definition of strong dominating set as well as resolving set. The resolving strong domination number of graph G, denoted by γrst(G), is the minimum cardinality of resolving strong dominating set of G. In this paper, we determine the resolving strong domination number of some wheel related graphs, namely helm graph Hn, gear graph Gn, and flower graph Fln. Through this paper, we will use the notations γst(G) and dim(G) which show the strong domination and dimension numbers.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.