Enumeration of spanning trees in the sequence of Dürer graphs
type: Item
instance of: scholarly article
title: Enumeration of spanning trees in the sequence of Dürer graphs
zbMATH Open document ID: 1380.05105
published in: Open Mathematics
publication date: 2018-02-15T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C63
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6839625
zbMATH Keywords: spanning trees
zbMATH Keywords: electrically equivalent transformation
zbMATH Keywords: entropy
author: Shi-Xing Li
MaRDI profile type: Publication
full work available at URL: math-2017-0136
OpenAlex ID: W2792700515
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: Coherence in a family of tree networks with an application of Laplacian spectrum
cites work: The emergence of space-time gravitational physics as an effective theory from the \(c=1\) matrix model
cites work: Interaction of excitable waves emitted from two defects by pulsed electric fields
cites work: Parameter identification based on lag synchronization via hybrid feedback control in uncertain drive-response dynamical networks
cites work: Q3550099
cites work: Spanning Trees and Optimization Problems
cites work: Asymptotic Enumeration of Spanning Trees
cites work: Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
cites work: On the number of spanning trees on various lattices
cites work: Weighted spanning trees on some self-similar graphs
cites work: Spanning trees on the Sierpinski gasket
cites work: The number of spanning trees in Apollonian networks
cites work: The number of spanning trees in a prism
cites work: Enumeration of spanning trees in planar unclustered networks
cites work: Enumeration of spanning trees on Apollonian networks
cites work: COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
cites work: On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
cites work: Enumeration of spanning trees on contact graphs of disk packings
cites work: Determinant identities for Laplace matrices
cites work: Resistance scaling and the number of spanning trees in self-similar lattices
cites work: The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
cites work: Spanning trees on graphs and lattices inddimensions
DOI: 10.1515/MATH-2017-0136
description: scientific article; zbMATH DE number 6839625