New method for counting the number of spanning trees in a two-tree network
From MaRDI portal
Publication:1673210
DOI10.1016/J.PHYSA.2013.05.007zbMATH Open1395.05174OpenAlexW1992346289MaRDI QIDQ1673210FDOQ1673210
Authors: Yuzhi Xiao, Haixing 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
Recommendations
- Enumeration of spanning trees in planar unclustered networks
- Counting spanning trees in self-similar networks by evaluating determinants
- An iteration method for computing the total number of spanning trees and its applications in graph theory
- The number of spanning trees in a class of double fixed-step loop networks
- An algorithm for the enumeration of spanning trees
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Title not available (Why is that?)
- Asymptotic Enumeration of Spanning Trees
- Spanning trees on graphs and lattices inddimensions
- Counting spanning trees in self-similar networks by evaluating determinants
- Spanning trees on the Sierpinski gasket
- On the number of spanning trees on various lattices
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
- A survey of some network reliability analysis and synthesis results
Cited In (17)
- A new class of the planar networks with high clustering and high entropy
- Enumeration of spanning trees of graph: alternative methods
- Invulnerability of planar two-tree networks
- The evaluation of the number and the entropy of spanning trees on generalized small-world networks
- A general scheme for log-determinant computation of matrices via stochastic polynomial approximation
- 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 class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters
- On constructing rational spanning tree edge densities
- Enumeration of spanning trees of 2-separable networks
- Enumeration of subtrees of planar two-tree networks
- Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network
- Extremal graphs for the Tutte polynomial
- An iteration method for computing the total number of spanning trees and its applications in graph theory
- Enumeration of spanning trees in planar unclustered networks
- Counting spanning trees in self-similar networks by evaluating determinants
- Application of a generalized Sherman-Morrison formula to the computation of network Green's functions and the construction of spanning trees
This page was built for publication: New method for counting the number of spanning trees in a two-tree network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673210)
