Advertisement
Published in:
2024 | OriginalPaper | Chapter
Properties of Sierpinski Triangle Graphs
Author : Allan Bickle
Published in: Combinatorics, Graph Theory and Computing
Publisher: Springer Nature Switzerland
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by (Link opens in a new window)
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.
