New method for counting the number of spanning trees in a two-tree network

DOI10.1016/j.physa.2013.05.007zbMath1395.05174OpenAlexW1992346289MaRDI QIDQ1673210

Yuzhi Xiao, Hai-xing Zhao

Publication date: 11 September 2018

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

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

zbMATH Keywords

number of spanning treescomplex networktwo-tree network

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

On constructing rational spanning tree edge densities ⋮ A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters ⋮ Enumeration of subtrees of planar two-tree networks ⋮ Extremal graphs for the Tutte polynomial ⋮ Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network ⋮ An iteration method for computing the total number of spanning trees and its applications in graph theory ⋮ A general scheme for log-determinant computation of matrices via stochastic polynomial approximation ⋮ Invulnerability of planar two-tree networks ⋮ 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 ⋮ Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth ⋮ A new class of the planar networks with high clustering and high entropy

Cites Work

• Unnamed Item
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Spanning trees on the Sierpinski gasket
• Counting spanning trees in self-similar networks by evaluating determinants
• On the number of spanning trees on various lattices
• A survey of some network reliability analysis and synthesis results
• Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
• Spanning trees on graphs and lattices inddimensions
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: New method for counting the number of spanning trees in a two-tree network