The number of spanning trees in Apollonian networks

DOI10.1016/j.dam.2014.01.015zbMath1288.05066arXiv1210.0090OpenAlexW2149141576WikidataQ57772686 ScholiaQ57772686MaRDI QIDQ2449073

Bin Wu, Francesc Comellas, Zhong-Zhi Zhang

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.0090

zbMATH Keywords

self-similarcomplex networksspanning treesscale-freesmall-world graphsApollonian networksmaximally planar

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Enumeration of spanning trees on contact graphs of disk packings, Tutte polynomial of scale-free networks, On constructing rational spanning tree edge densities, On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs, The relations between network-operation and topological-property in a scale-free and small-world network with community structure, A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters, A family of small-world network models built by complete graph and iteration-function, Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory, Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs, A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks, An iteration method for computing the total number of spanning trees and its applications in graph theory, Modeling spatial networks by contact graphs of disk packings, The number and degree distribution of spanning trees in the Tower of Hanoi graph, Spectral analysis of weighted neighborhood networks, Enumeration of spanning trees in the sequence of Dürer graphs, COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS, Random growth networks with exponential degree distribution, Tutte polynomial of the Apollonian network, Potts model partition functions on two families of fractal lattices, Strong geodetic problem in networks, Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models by Ma and Yao, Pfaffian orientations and perfect matchings of scale-free networks, Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth, Volume Bounds for the Phase-Locking Region in the Kuramoto Model with Asymmetric Coupling, Laplacian spectra for categorical product networks and its applications, LEADER–FOLLOWER COHERENCE OF THE WEIGHTED RECURSIVE TREE NETWORKS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistance scaling and the number of spanning trees in self-similar lattices
• Spanning trees on the Sierpinski gasket
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• Counting spanning trees in self-similar networks by evaluating determinants
• High-dimensional Apollonian networks
• The Structure and Function of Complex Networks
• High-precision entropy values for spanning trees in lattices
• Spanning trees on graphs and lattices inddimensions
• Asymptotic Enumeration of Spanning Trees
• The Apollonian Packing of Circles