Counting spanning trees in almost complete multipartite graphs
type: Item
instance of: scholarly article
title: Counting spanning trees in almost complete multipartite graphs
zbMATH Open document ID: 1498.05130
author: Sujing Cheng
author: Wuxian Chen
author: Weigen Yan
published in: Journal of Algebraic Combinatorics
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7596168
zbMATH Keywords: almost complete multipartite graph
zbMATH Keywords: almost complete bipartite graph
zbMATH Keywords: almost complete graph
zbMATH Keywords: spanning tree
MaRDI profile type: Publication
full work available at URL: s10801-022-01131-4
OpenAlex ID: W4226281875
cites work: Algebraic Graph Theory
cites work: Algebraic Potential Theory on Graphs
cites work: Q5159249
cites work: Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
cites work: The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
cites work: Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
cites work: Simplicial matrix-tree theorems
cites work: Enumerative properties of Ferrers graphs
cites work: Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
cites work: Resistance distance in complete \(n\)-partite graphs
cites work: A simple formula for the number of spanning trees of line graphs
cites work: Linear algebraic techniques for weighted spanning tree enumeration
cites work: Q5616724
cites work: Determinant identities for Laplace matrices
cites work: Enumerating spanning trees of graphs with an involution
cites work: The enumeration of spanning tree of weighted graphs
DOI: 10.1007/S10801-022-01131-4
description: scientific article; zbMATH DE number 7596168