The distance 2-resolving domination number of graphs

D. A.R. Wardani, M. I. Utoyo, Dafik, K. Dliou

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Article number012017
JournalJournal of Physics: Conference Series
Volume1836
Issue number1
DOIs
Publication statusPublished - 23 Mar 2021
Event4th International Conference on Combinatorics, Graph Theory, and Network Topology, ICCGANT 2020 - Jember, East Java, Indonesia
Duration: 22 Aug 202023 Aug 2020

Fingerprint

Dive into the research topics of 'The distance 2-resolving domination number of graphs'. Together they form a unique fingerprint.

Cite this