Article thumbnail

The number of spanning trees in Apollonian networks

By Zhongzhi Zhang, Bin Wu and Francesc de Paula Comellas Padró


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 spanning trees is of particular relevance. Our results allow also the calculation of the spanning tree entropy of Apollonian networks, which we compare with those of other graphs with the same average degree. (C) 2014 Elsevier B.V. All rights reserved

Topics: Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta, Computer science--Mathematics, Apollonian networks, Spanning trees, Small-world graphs, Complex networks, Self-similar, Maximally planar, Scale-free, Complex Networks, Lattices, Enumeration, Informàtica -- Matemàtica
OAI identifier:
Provided by: RECERCAT
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.