Power domination in Knödel graphs and Hanoi graphs

DOI10.7151/dmgt.1993zbMath1377.05147OpenAlexW2710351471MaRDI QIDQ1692626

Seethu Varghese, Andreas M. Hinz, Ambat Vijayakumar

Publication date: 10 January 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1993

zbMATH Keywords

dominationpower dominationHanoi graphKnödel graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Power domination in Mycielskian of spiders ⋮ Domination in Kn\"odel Graphs ⋮ The Hanoi graph \(H_4^3\) ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ A survey and classification of Sierpiński-type graphs ⋮ Power Domination in Graphs ⋮ Total domination in cubic Knodel graphs

Cites Work

• Unnamed Item
• Generalized power domination of graphs
• A survey and classification of Sierpiński-type graphs
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• New gossips and telephones
• A survey on Knödel graphs.
• The tower of Hanoi
• Generalized power domination: propagation radius and Sierpiński graphs
• A note on power domination in grid graphs
• Power domination in graphs
• On the Power Domination Number of Graph Products
• Generalized Power Domination in Regular Graphs
• The Tower of Hanoi – Myths and Maths
• Power Domination in Product Graphs
• A Note on the Dimensionality of Modified Knödel Graphs
• Domination in Graphs Applied to Electric Power Networks
• Complete rotations in Cayley graphs

This page was built for publication: Power domination in Knödel graphs and Hanoi graphs