Sierpinski Graphs

Andreas M. Hinz (), Sandi Klavžar (), Uroš Milutinović () and Ciril Petr ()
Additional contact information
Andreas M. Hinz: LMU München, Faculty of Mathematics, Computer Science and Statistics, Institut für Mathematik
Sandi Klavžar: University of Ljubljana, Faculty of Mathematics and Physics
Uroš Milutinović: University of Maribor, Faculty of Natural Sciences and Mathematics
Ciril Petr: University of Maribor, Faculty of Natural Sciences and Mathematics

Chapter Chapter 5 in The Tower of Hanoi – Myths and Maths, 2013, pp 141-164 from Springer

Abstract: 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.

Keywords: Short Path; Optimal Path; Chromatic Number; Iterate Function System; Domination Number (search for similar items in EconPapers)
Date: 2013
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-0348-0237-6_5

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

DOI: 10.1007/978-3-0348-0237-6_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 ().