Independence polynomial of the Sierpinski gasket graph and the tower of Hanoi graph

K.U. Sreeja, P.B. Vinodkumar, P.B. Ramkumar

Abstract


In dynamical systems, the most well-known fractals are the Sierpinski gasket graph, also known as the Sierpinski fractal, and the Tower of Hanoi graph. In this paper, we investigate the nth generated independence polynomial of these graphs as well as its properties. In order to partition its spanning subgraphs, we use iterative patterns of the Sierpinski graph and the Hanoi graph. Furthermore, we consider the relationship between the Tower of Hanoi graph and the Sierpinski fractal in terms of their independence polynomial.

Full Text: PDF

Published: 2021-08-30

How to Cite this Article:

K.U. Sreeja, P.B. Vinodkumar, P.B. Ramkumar, Independence polynomial of the Sierpinski gasket graph and the tower of Hanoi graph, J. Math. Comput. Sci., 11 (2021), 7072-7081

Copyright © 2021 K.U. Sreeja, P.B. Vinodkumar, P.B. Ramkumar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

Copyright ©2022 JMCS