Loading...
Loading...

Go to the content (press return)

The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs

Author
Comellas, F.; Miralles, A.; Hongxiao, L.; Zhang, Z.
Type of activity
Journal article
Journal
Physica A: statistical mechanics and its applications
Date of publication
2013-06
Volume
392
Number
12
First page
2803
Last page
2806
DOI
https://doi.org/10.1016/j.physa.2012.10.047 Open in new window
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 ...
Keywords
Complex networks, Self-similarity, Spanning trees, Tree entropy
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants