Enumeration of spanning trees in planar unclustered networks
type: Item
instance of: scholarly article
title: Enumeration of spanning trees in planar unclustered networks
zbMATH Open document ID: 1395.05164
author: Yuzhi Xiao
author: Guona Hu
author: Xiujuan Ma
author: Haixing Zhao
published in: Physica A
publication date: 2018-09-20T00:00:00Z
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6939995
zbMATH Keywords: complex networks
zbMATH Keywords: spanning trees
zbMATH Keywords: computational complexity
zbMATH Keywords: planar networks
MaRDI profile type: Publication
full work available at URL: j.physa.2014.03.028
OpenAlex ID: W1970763025
cites work: Q5422499
cites work: On unreliability polynomials and graph connectivity in reliable network synthesis
cites work: Geometry of minimum spanning trees on scale-free networks
cites work: Dimers on a simple-quartic net with a vacancy
cites work: High-precision entropy values for spanning trees in lattices
cites work: On the number of spanning trees on various lattices
cites work: Spanning trees on graphs and lattices inddimensions
cites work: Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
cites work: Spanning trees on the Sierpinski gasket
cites work: Counting spanning trees in self-similar networks by evaluating determinants
cites work: Mapping Koch curves into scale-free small-world networks
cites work: The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
cites work: Label-based routing for a family of scale-free, modular, planar and unclustered graphs
cites work: New method for counting the number of spanning trees in a two-tree network
cites work: The Structure and Function of Complex Networks
DOI: 10.1016/J.PHYSA.2014.03.028
description: scientific article; zbMATH DE number 6939995