TY - JOUR
T1 - The distance 2-resolving domination number of graphs
AU - Wardani, D. A.R.
AU - Utoyo, M. I.
AU - Dafik,
AU - Dliou, K.
N1 - Publisher Copyright:
© 2021 Published under licence by IOP Publishing Ltd.
PY - 2021/3/23
Y1 - 2021/3/23
N2 - The distance 2-resolving dominating set is the combination of two concepts, the resolving set and the distance 2-dominating set. The distance 2-resolving dominating set is a set that is both a distance 2-dominating set and a resolving set. The distance 2-resolving domination number is the minimum cardinality of a distance 2-resolving dominating set, denoted by ?2 (G). In this study, we define the distance 2-resolving dominating sets, and we examine distance 2-resolving domination number of graphs. We give the exact value of the distance 2-resolving domination number of complete graph, star graph, friendship graph and path graph.
AB - The distance 2-resolving dominating set is the combination of two concepts, the resolving set and the distance 2-dominating set. The distance 2-resolving dominating set is a set that is both a distance 2-dominating set and a resolving set. The distance 2-resolving domination number is the minimum cardinality of a distance 2-resolving dominating set, denoted by ?2 (G). In this study, we define the distance 2-resolving dominating sets, and we examine distance 2-resolving domination number of graphs. We give the exact value of the distance 2-resolving domination number of complete graph, star graph, friendship graph and path graph.
UR - http://www.scopus.com/inward/record.url?scp=85103545349&partnerID=8YFLogxK
U2 - 10.1088/1742-6596/1836/1/012017
DO - 10.1088/1742-6596/1836/1/012017
M3 - Conference article
AN - SCOPUS:85103545349
SN - 1742-6588
VL - 1836
JO - Journal of Physics: Conference Series
JF - Journal of Physics: Conference Series
IS - 1
M1 - 012017
T2 - 4th International Conference on Combinatorics, Graph Theory, and Network Topology, ICCGANT 2020
Y2 - 22 August 2020 through 23 August 2020
ER -
