Enumeration of spanning trees in planar unclustered networks

DOI10.1016/J.PHYSA.2014.03.028MaRDI QIDQ1782858zbMATH OpenOpenAlexFDO

Authors Yuzhi Xiao, Guona Hu, Xiujuan Ma, Haixing Zhao

Publication date 20 September 2018

Published in Physica A (Search for Journal in Brave)

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

zbMATH Keywords

spanning treescomputational complexitycomplex networksplanar networks

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• New method for counting the number of spanning trees in a two-tree network
• Counting spanning trees in self-similar networks by evaluating determinants
• The number of spanning trees in Apollonian networks
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• The number of spanning trees of a family of plane graph

Cites work

• Counting spanning trees in self-similar networks by evaluating determinants
• Dimers on a simple-quartic net with a vacancy
• Geometry of minimum spanning trees on scale-free networks
• Graph theory
• Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
• High-precision entropy values for spanning trees in lattices
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs
• Mapping Koch curves into scale-free small-world networks
• New method for counting the number of spanning trees in a two-tree network
• On the number of spanning trees on various lattices
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Spanning trees on graphs and lattices inddimensions
• Spanning trees on the Sierpinski gasket
• The Structure and Function of Complex Networks
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs

Cited in

(19)

• Application of a generalized Sherman-Morrison formula to the computation of network Green's functions and the construction of spanning trees
• Enumeration of spanning trees of graph: alternative methods
• Multi-vehicle detection algorithm through combining Harr and HOG features
• The evaluation of the number and the entropy of spanning trees on generalized small-world networks
• 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 spanning trees on Apollonian networks
• Enumeration of spanning trees of 2-separable networks
• Enumeration of subtrees of planar two-tree networks
• Enumeration of spanning trees on contact graphs of disk packings
• New method for counting the number of spanning trees in a two-tree network
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• An iteration method for computing the total number of spanning trees and its applications in graph theory
• Enumeration of spanning trees in the sequence of Dürer graphs
• The number of spanning trees of a family of plane graph
• Counting spanning trees in prism and anti-prism graphs
• The number of spanning trees of certain families of planar maps
• The number of spanning trees in Apollonian networks
• Counting spanning trees in self-similar networks by evaluating determinants

This page was built for publication: Enumeration of spanning trees in planar unclustered networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782858)