The Hanoi graph \(H_4^3\)

DOI10.7151/dmgt.2202zbMath1446.05071OpenAlexW2912270740MaRDI QIDQ2194534

Andreas M. Hinz, Nazanin Movarraei

Publication date: 26 August 2020

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

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

zbMATH Keywords

domination numberSierpiński graphsHanoi graphsmetric dimensiondominator chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

The median of Sierpiński graphs ⋮ Metric properties of Sierpiński triangle graphs

Cites Work

• Unnamed Item
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Coloring Hanoi and Sierpiński graphs
• A survey and classification of Sierpiński-type graphs
• On the planarity of Hanoi graphs
• A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
• Dominator coloring of generalized Petersen graphs
• Power domination in Knödel graphs and Hanoi graphs
• Open problems for Hanoi and Sierpiński graphs
• The Tower of Hanoi – Myths and Maths
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension
• Crossing numbers of Sierpiński‐like graphs

This page was built for publication: The Hanoi graph \(H_4^3\)