Enumeration of spanning trees on Apollonian networks

DOI10.1088/1742-5468/2013/09/P09015zbMath1456.05161OpenAlexW2092488334MaRDI QIDQ3301692

Jingyuan Zhang, Guang-Hui Xu, Wei-Gang Sun

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1742-5468/2013/09/p09015

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (7)

A general method for computing Tutte polynomials of self-similar graphs ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Tutte polynomial of the Apollonian network ⋮ A survey and classification of Sierpiński-type graphs ⋮ Strong geodetic problem in networks ⋮ Number of spanning trees in the sequence of some graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted spanning trees on some self-similar graphs
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Spanning trees on the Sierpinski gasket
• Geometry of minimum spanning trees on scale-free networks
• Emergence of Scaling in Random Networks
• Towers of hanoi graphs
• Spanning trees on graphs and lattices inddimensions
• Collective dynamics of ‘small-world’ networks
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Enumeration of spanning trees on Apollonian networks