Sierpiński graphs as spanning subgraphs of Hanoi graphs

DOI10.2478/S11533-013-0227-7zbMath1267.05172OpenAlexW2130530653MaRDI QIDQ352716

Sara Sabrina Zemljič, Andreas M. Hinz, Sandi Klavžar

Publication date: 5 July 2013

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-013-0227-7

zbMATH Keywords

Hamming graphspanning subgraphHanoi graphSierpiński graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Sierpiński products of r-uniform hypergraphs ⋮ The Sierpiński product of graphs ⋮ On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs ⋮ The Hanoi graph \(H_4^3\) ⋮ A survey and classification of Sierpiński-type graphs ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Structural properties of subdivided-line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring Hanoi and Sierpiński graphs
• The hub number of Sierpiński-like graphs
• On the planarity of Hanoi graphs
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• The tower of Hanoi
• The average eccentricity of Sierpiński graphs
• The Group of Symmetries of the Tower of Hanoi Graph
• Coloring and Counting on the Tower of Hanoi Graphs
• Fractals and Universal Spaces in Dimension Theory
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• On the Frame--Stewart Conjecture about the Towers of Hanoi
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata

This page was built for publication: Sierpiński graphs as spanning subgraphs of Hanoi graphs