Power domination in Kn\"odel graphs and Hanoi graphs
Andréas Hinz, Seethu Varghese, Ambat Vijayakumar · Discussiones Mathematicae Graph Theory · 2017
In this paper, we study the power domination problem in Kndel graphs W ,2 and Hanoi graphs H n p . We determine the power domination number of W 3,2 and provide an upper bound for the power domination number of W r+1,2 r+1 for r 3. We also compute the k-power domination number and the k-propagation radius of H 2 p .