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

8 years 6 months ago

Download www-ma4.upc.edu

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 ﬁrst establish recursion relations between the number of spanning trees and other spanning subgraphs of the Hanoi graph, from which we ﬁnd 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 ﬁnd, for each vertex of the graph, its degree distribution among all possible spanning trees.

Zhongzhi Zhang, Shunqi Wu, Mingyun Li, Francesc Co

Real-time Traffic