Sierpiński graphs as spanning subgraphs of Hanoi graphs
Hanoi graphs H p n model the Tower of Hanoi game with p pegs and n discs. Sierpinski graphs S p n arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that S p n embeds as a spanning subgraph into H p n if and only if p is odd or, triviall...
Gespeichert in:
Veröffentlicht in: | Central European journal of mathematics 2013-06, Vol.11 (6), p.1153-1157 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Hanoi graphs
H
p
n
model the Tower of Hanoi game with
p
pegs and
n
discs. Sierpinski graphs
S
p
n
arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that
S
p
n
embeds as a spanning subgraph into
H
p
n
if and only if
p
is odd or, trivially, if
n
= 1. |
---|---|
ISSN: | 1895-1074 2391-5455 1644-3616 2391-5455 |
DOI: | 10.2478/s11533-013-0227-7 |