Independent sets on the Towers of Hanoi graphs

Hanlin Chen, Renfang Wu, Guihua Huang, Hanyuan Deng

Abstract


The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. In this article, we mainly study the number of independent sets i(Hn) on the Tower of Hanoi graph Hn at stage n, and derive the recursion relations for the numbers of independent sets. Upper and lower bounds for the asymptotic growth constant μ on the Towers of Hanoi graphs are derived in terms of the numbers at a certain stage, where μ = limv → ∞(lni(G)) / v(G) and v(G) is the number of vertices in a graph G. Furthermore, we also consider the number of independent sets on the Sierpiński graphs which contain the Towers of Hanoi graphs as a special case.


Keywords


Independent sets, the Tower of Hanoi graph, Sierpiński graph, recursion relation, asymptotic growth constant, asymptotic enumeration

Full Text:

PDF ABSTRACTS (EN/SI)


ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications