2022
DOI: 10.1088/1742-6596/2157/1/012015
|View full text |Cite
|
Sign up to set email alerts
|

On the resolving strong domination number of some wheel related graphs

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 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 res… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…A vertex dominates the vertex not in D that has at least the same degree. In this situation, we say that y strongly dominates x [8]. The resolving strong dominating set is the set of 𝐷 𝑠 ∈ 𝑉(𝐺), where Ds satisfies the definition of the strong dominating set and the resolving set.…”
Section: Introductionmentioning
confidence: 99%
“…A vertex dominates the vertex not in D that has at least the same degree. In this situation, we say that y strongly dominates x [8]. The resolving strong dominating set is the set of 𝐷 𝑠 ∈ 𝑉(𝐺), where Ds satisfies the definition of the strong dominating set and the resolving set.…”
Section: Introductionmentioning
confidence: 99%