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 determine 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 diameter paths for both classes, generalizing the classic Towers of Hanoi problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bickle, A.: Fundamentals of Graph Theory, AMS (2020)
Bickle, A., Phillips, B.: t-Tone colorings of graphs. Utilitas Math. 106, 85–102 (2018)
Bradley, R.M.: Statistical mechanics of the travelling salesman on the Sierpinski gasket. J. Physique 47, 9–14 (1986)
Hinz, A., Klavzar, S., Zemljic, S.: A survey and classification of Sierpinski-type graphs. Discrete Appl. Math. 217(3), 565–600 (2017)
Klavzar, S.: Coloring Sierpinski graphs and Sierpinski gasket graphs. Taiwanese J. Math. 12(2), 513–522 (2008)
Teguia, A., Godbole, A.: Sierpinski Gasket graphs and some of their properties. Australasian J. Combin. 35, 181–192 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bickle, A. (2024). Properties of Sierpinski Triangle Graphs. In: Hoffman, F., Holliday, S., Rosen, Z., Shahrokhi, F., Wierman, J. (eds) Combinatorics, Graph Theory and Computing. SEICCGTC 2021. Springer Proceedings in Mathematics & Statistics, vol 448. Springer, Cham. https://doi.org/10.1007/978-3-031-52969-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-031-52969-6_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-52968-9
Online ISBN: 978-3-031-52969-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)