Abstract
On several occasions in Chap. 2 we realized that a different labelling for there cursively obtained Hanoi graphs \( H_{3}^{n} \) (see Figure 2.12) would be desirable. We will realize this with the same recursive procedure, yielding graphs isomorphic to \( H_{3}^{n} \), with the same vertex set, but with different edge sets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer Basel
About this chapter
Cite this chapter
Hinz, A.M., Klavžar, S., Milutinović, U., Petr, C. (2013). Sierpinski Graphs. In: The Tower of Hanoi – Myths and Maths. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0237-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0237-6_5
Published:
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-0236-9
Online ISBN: 978-3-0348-0237-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)