Abstract
On several occasions in Chapter 2 we realized that a different labeling for the recursively obtained Hanoi graphs H n3 (see Figure 2.12) would be desirable. We will realize this with the same recursive procedure, yielding graphs isomorphic to H n3 , 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
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Hinz, A.M., Klavžar, S., Petr, C. (2018). Sierpiński Graphs. In: The Tower of Hanoi – Myths and Maths. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-73779-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-73779-9_5
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-73778-2
Online ISBN: 978-3-319-73779-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)