Counting spanning trees in self-similar networks by evaluating determinants

DOI10.1063/1.3659687zbMath1272.05187arXiv1105.0565MaRDI QIDQ2851758

Bin Wu, Zhong-Zhi Zhang, Yu-An Lin, Guan-Rong Chen

Publication date: 2 October 2013

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

Laplacian matrix; spanning trees; \((x, y)\)-flowers; self-similar networks; computing determinants

Mathematics Subject Classification ID

05C05: Trees

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

65F40: Numerical computation of determinants

28A80: Fractals

Related Items

Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters, COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS, Tutte polynomial of scale-free networks, The number and degree distribution of spanning trees in the Tower of Hanoi graph, Enumeration of spanning trees on contact graphs of disk packings, New method for counting the number of spanning trees in a two-tree network, An iteration method for computing the total number of spanning trees and its applications in graph theory, Tutte polynomials of two self-similar network models, A general scheme for log-determinant computation of matrices via stochastic polynomial approximation, The normalized Laplacian spectrum of quadrilateral graphs and its applications, The evaluation of the number and the entropy of spanning trees on generalized small-world networks, Enumeration of spanning trees in planar unclustered 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, A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters, Two-point resistances in a family of self-similar \((x, y)\)-flower networks, The behavior of Tutte polynomials of graphs under five graph operations and its applications, A new class of the planar networks with high clustering and high entropy, The number of spanning trees in Apollonian networks, Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network

Cites Work

• Unnamed Item
• Resistance scaling and the number of spanning trees in self-similar lattices
• Spanning trees: A survey
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Spanning trees on the Sierpinski gasket
• Resistance distance in wheels and fans
• The hierarchical product of graphs
• Matrix tree theorems
• Geometry of minimum spanning trees on scale-free networks
• The chip-firing game
• Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network
• Embedding Spanning Trees in Random Graphs
• Mapping Koch curves into scale-free small-world networks
• On the number of spanning trees on various lattices
• A survey of some network reliability analysis and synthesis results
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
• Counting Minimum Weight Spanning Trees
• The Structure and Function of Complex Networks
• Spanning Trees and Optimization Problems
• High-precision entropy values for spanning trees in lattices
• Spanning trees on graphs and lattices inddimensions
• Self-organized critical state of sandpile automaton models
• MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
• DIMERS AND SPANNING TREES: SOME RECENT RESULTS
• Collective dynamics of ‘small-world’ networks
• The average distances in random graphs with given expected degrees
• Asymptotic Enumeration of Spanning Trees
• The Apollonian Packing of Circles