Power Domination in Knödel Graphs and Hanoi Graphs

Power Domination in Knödel Graphs and Hanoi Graphs

In this paper, we study the power domination problem in Knödel graphs and Hanoi graphs . We determine the power domination number of and provide an upper bound for the power domination number of for ≥ 3. We also compute the -power domination number and the -propagation radius of .

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discussiones Mathematicae. Graph Theory 2018-02, Vol.38 (1), p.63-74
Hauptverfasser: Varghese, Seethu, Vijayakumar, A., Hinz, Andreas M.
Format: Artikel
Sprache:eng
Schlagworte:
05C69
domination
Hanoi graph
Knödel graph
power domination
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we study the power domination problem in Knödel graphs and Hanoi graphs . We determine the power domination number of and provide an upper bound for the power domination number of for ≥ 3. We also compute the -power domination number and the -propagation radius of .
ISSN:2083-5892
DOI:10.7151/dmgt.1993