Carregant...
Carregant...

Vés al contingut (premeu Retorn)

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

Autor
Comellas, F.; Miralles, A.; Hongxiao, L.; Zhang, Z.
Tipus d'activitat
Article en revista
Revista
Physica A: statistical mechanics and its applications
Data de publicació
2013-06
Volum
392
Número
12
Pàgina inicial
2803
Pàgina final
2806
DOI
https://doi.org/10.1016/j.physa.2012.10.047 Obrir en finestra nova
Resum
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 ...
Paraules clau
Spanning Trees, Tree Entropy, Complex Networks, Self-similarity
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions

Participants