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 D
s ⊂ 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.