Title
The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
Abstract
In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its reliability, synchronization capability and diffusion properties. The calculation of the number of spanning trees is a demanding and difficult task, in particular for large graphs, and thus there is much interest in obtaining closed expressions for relevant infinite graph families. We have also calculated the spanning tree entropy of the graphs which we have compared with those for graphs with the same average degree.
Year
DOI
Venue
2012
10.1016/j.physa.2012.10.047
Physica A: Statistical Mechanics and its Applications
Keywords
Field
DocType
Spanning trees,Tree entropy,Complex networks,Self-similarity
Discrete mathematics,Outerplanar graph,Trémaux tree,Indifference graph,Combinatorics,Chordal graph,Spanning tree,Pathwidth,1-planar graph,Mathematics,Dense graph
Journal
Volume
Issue
ISSN
392
12
0378-4371
Citations 
PageRank 
References 
3
0.56
4
Authors
4
Name
Order
Citations
PageRank
Francesc Comellas115525.07
Alicia Miralles2183.94
Hongxiao Liu330.56
Zhongzhi Zhang48522.02