Sierpiński Graphs

Andreas M. Hinz, Sandi Klavžar and Ciril Petr
Additional contact information
Andreas M. Hinz: LMU München, Faculty of Mathematics, Computer Science and Statistics
Sandi Klavžar: University of Ljubljana, Faculty of Mathematics and Physics
Ciril Petr: University of Maribor, Faculty of Natural Sciences and Mathematics

Chapter Chapter 4 in The Tower of Hanoi – Myths and Maths, 2018, pp 175-206 from Springer

Abstract: Abstract On several occasions in Chapter 2 we realized that a different labeling for the recursively 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.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-73779-9_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319737799

DOI: 10.1007/978-3-319-73779-9_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().