Enumeration of spanning trees in planar unclustered networks

DOI10.1016/j.physa.2014.03.028zbMath1395.05164OpenAlexW1970763025MaRDI QIDQ1782858

Xiujuan Ma, Guona Hu, Yuzhi Xiao, Hai-xing 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

computational complexitycomplex networksspanning treesplanar networks

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ 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 ⋮ COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS ⋮ The evaluation of the number and the entropy of spanning trees on generalized small-world networks ⋮ Multi-vehicle detection algorithm through combining Harr and HOG features

Cites Work

• Unnamed Item
• Spanning trees on the Sierpinski gasket
• Geometry of minimum spanning trees on scale-free networks
• The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
• New method for counting the number of spanning trees in a two-tree network
• Dimers on a simple-quartic net with a vacancy
• Counting spanning trees in self-similar networks by evaluating determinants
• Label-based routing for a family of scale-free, modular, planar and unclustered graphs
• Mapping Koch curves into scale-free small-world networks
• On the number of spanning trees on various lattices
• 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
• The Structure and Function of Complex Networks
• High-precision entropy values for spanning trees in lattices
• Spanning trees on graphs and lattices inddimensions

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