An iteration method for computing the total number of spanning trees and its applications in graph theory
type: Item
instance of: scholarly article
title: An iteration method for computing the total number of spanning trees and its applications in graph theory
zbMATH Open document ID: 1383.05054
author: Fei Ma
author: Bing Yao
published in: Theoretical Computer Science
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 6820622
zbMATH Keywords: Brouwer's fixed-point theorem
zbMATH Keywords: algorithms
zbMATH Keywords: Cayley's theorem
zbMATH Keywords: number of spanning trees
zbMATH Keywords: ladder graph
zbMATH Keywords: wheel graph
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.10.030
OpenAlex ID: W2767475077
cites work: Deterministic scale-free networks
cites work: The average distances in random graphs with given expected degrees
cites work: Q3267900
cites work: Q3165005
cites work: The number of spanning trees in Apollonian networks
cites work: Q3097395
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
cites work: Geometry of minimum spanning trees on scale-free networks
cites work: Loop-erased random walks, spanning trees and Hamiltonian cycles
cites work: Q2716030
cites work: ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
cites work: Spanning trees on graphs and lattices inddimensions
cites work: New method for counting the number of spanning trees in a two-tree network
cites work: Enumeration of spanning trees in planar unclustered networks
cites work: On the spectrum of the normalized Laplacian of iterated triangulations of graphs
cites work: The normalized Laplacian spectrum of subdivisions of a graph
cites work: The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
cites work: On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
DOI: 10.1016/J.TCS.2017.10.030
description: scientific article; zbMATH DE number 6820622