The number and degree distribution of spanning trees in the Tower of Hanoi graph

详细信息    查看全文

• 作者：Zhongzhi Zhang^a ; ^b ; ^{zhangzz@fudan.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Shunqi Wu^a ; ^b ; Mingyun Li^a ; ^b ; Francesc Comellas^c ; ^{francesc.comellas@upc.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Spanning trees ; Tower of Hanoi graph ; Degree distribution ; Fractal geometry
• 刊名：Theoretical Computer Science
• 出版年：2016
• 出版时间：4 January 2016
• 年：2016
• 卷：609
• 期：part_P2
• 页码：443-455
• 全文大小：583 K

文摘

The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so on. However, the practical enumeration of spanning trees and the study of their properties remain a challenge, particularly for large networks. In this paper, we study the number and degree distribution of the spanning trees in the Hanoi graph. We first establish recursion relations between the number of spanning trees and other spanning subgraphs of the Hanoi graph, from which we find an exact analytical expression for the number of spanning trees of the n-disc Hanoi graph. This result allows the calculation of the spanning tree entropy which is then compared with those for other graphs with the same average degree. Then, we introduce a vertex labeling which allows to find, for each vertex of the graph, its degree distribution among all possible spanning trees.