Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The number of spanning trees in Apollonian networks

Autor
Zhang, Z.; Wu, B.; Comellas, F.
Tipus d'activitat
Article en revista
Revista
Discrete applied mathematics
Data de publicació
2014-05-31
Volum
169
Pàgina inicial
206
Pàgina final
213
DOI
https://doi.org/10.1016/j.dam.2014.01.015 Obrir en finestra nova
Projecte finançador
COMBINATÒRIA , TEORIA DE GRAFS I APLICACIONS
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Repositori
http://hdl.handle.net/2117/26688 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0166218X14000195 Obrir en finestra nova
Resum
In this paper we find an exact analytical expression for the number of spanning trees in Apollonian networks. This parameter can be related to significant topological and dynamic properties of the networks, including percolation, epidemic spreading, synchronization, and random walks. As Apollonian networks constitute an interesting family of maximal planar graphs which are simultaneously small-world, scale-free, Euclidean and space filling, modular and highly clustered, the study of their spanni...
Citació
Zhang, Z.; Wu, B.; Comellas, F. The number of spanning trees in Apollonian networks. "Discrete applied mathematics", 31 Maig 2014, vol. 169, p. 206-213.
Paraules clau
Apollonian Networks, Spanning Trees, Small-world Graphs, Complex Networks, Self-similar, Maximally Planar, Scale-free, Complex Networks, Lattices, Enumeration
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius