Anzeige
Erschienen in:
2024 | OriginalPaper | Buchkapitel
Properties of Sierpinski Triangle Graphs
verfasst von : Allan Bickle
Erschienen in: Combinatorics, Graph Theory and Computing
Verlag: Springer Nature Switzerland
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by (Link öffnet in neuem Fenster)
Abstract
The Sierpinski triangle can be modeled using graphs in two different ways, resulting in classes of graphs called Sierpinski triangle graphs and Hanoi graphs. The latter are closely related to the Towers of Hanoi problem, Pascal’s triangle, and Apollonian networks. Parameters of these graphs have been studied by several researchers. We study the number of Eulerian circuits of Sierpinski triangle graphs and present a significantly shorter proof of their domination number. We also find the 2-tone chromatic number and the number of pairs of vertices at maximum distance for both classes, generalizing the classic Towers of Hanoi problem.
