New method for counting the number of spanning trees in a two-tree network
type: Item
instance of: scholarly article
title: New method for counting the number of spanning trees in a two-tree network
zbMATH Open document ID: 1395.05174
author: Yuzhi Xiao
author: Haixing Zhao
published in: Physica A
publication date: 2018-09-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 6935231
zbMATH Keywords: complex network
zbMATH Keywords: number of spanning trees
zbMATH Keywords: two-tree network
MaRDI profile type: Publication
full work available at URL: j.physa.2013.05.007
OpenAlex ID: W1992346289
cites work: Q3140234
cites work: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
cites work: Asymptotic Enumeration of Spanning Trees
cites work: A survey of some network reliability analysis and synthesis results
cites work: Spanning trees on graphs and lattices inddimensions
cites work: On the number of spanning trees on various lattices
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
DOI: 10.1016/J.PHYSA.2013.05.007
description: scientific article; zbMATH DE number 6935231