New method for counting the number of spanning trees in a two-tree network

The number of spanning trees is an important quantity characterizing the reliability of a network. Generally, the number of spanning trees in a network can be obtained by directly calculating a related determinant corresponding to the network. However, for a large network, evaluating the relevant determinant is intractable. In this paper, we investigate the number of spanning trees in two-tree networks. We first give a new algorithm which avoids the laborious computation of the determinant for counting the number of spanning trees. Using the algorithm, we can obtain the number of spanning trees of any two-tree network in linear time. The result shows that the computation complexity is O ( n ) , which is better than that of the matrix tree theorem with O ( n 2 ) , where n is the number of steps. We then characterize two-tree networks with the maximum and minimum numbers of spanning trees. Denote by P ( t ) and K ( t ) , respectively, the two-tree networks of t + 2 vertices with the maximum and minimum numbers of spanning trees. Denote by P A and E N , respectively, the two-tree network of t + 2 vertices generated by preferential attachment and by equiprobability attachment. By algorithmic analysis and through simulations, we conjecture that N S T ( K ( t ) ) ≤ N S T ( P A ) ≤ N S T ( E N ) ≤ N S T ( P ( t ) ) as t tends to infinity, where N S T ( G ) is the number of spanning trees of G . As an application of the algorithm, we give the formula of the number of spanning trees of a particular small-world network.