Enumeration of spanning trees on contact graphs of disk packings

DOI10.1016/j.physa.2015.03.047zbMath1400.05121OpenAlexW1983380661MaRDI QIDQ1618515

Sen Qin, Fangyue Chen, Xufeng Chen, Jingyuan Zhang

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2015.03.047

zbMATH Keywords

entropyspanning treeApollonian networkelectrically equivalent network

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30)

Related Items (3)

On constructing rational spanning tree edge densities ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Multi-vehicle detection algorithm through combining Harr and HOG features

Cites Work

• Resistance scaling and the number of spanning trees in self-similar lattices
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Spanning trees on the Sierpinski gasket
• Determinant identities for Laplace matrices
• Geometry of minimum spanning trees on scale-free networks
• Loop-erased random walks, spanning trees and Hamiltonian cycles
• Complex networks: structure and dynamics
• The number of spanning trees in Apollonian networks
• Counting spanning trees in self-similar networks by evaluating determinants
• Emergence of Scaling in Random Networks
• High-dimensional Apollonian networks
• THE FRACTAL DIMENSION OF THE APOLLONIAN SPHERE PACKING
• The Structure and Function of Complex Networks
• High-precision entropy values for spanning trees in lattices
• Collective dynamics of ‘small-world’ networks
• The Osculatory Packing of a Three Dimensional Sphere
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Enumeration of spanning trees on contact graphs of disk packings