Counting spanning trees in almost complete multipartite graphs

DOI10.1007/s10801-022-01131-4zbMath1498.05130OpenAlexW4226281875MaRDI QIDQ2082527

Wuxian Chen, Sujing Cheng, Weigen Yan

Publication date: 4 October 2022

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-022-01131-4

zbMATH Keywords

spanning treealmost complete bipartite graphalmost complete graphalmost complete multipartite graph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Resistance distance in complete \(n\)-partite graphs
• Enumerating spanning trees of graphs with an involution
• Determinant identities for Laplace matrices
• Enumerative properties of Ferrers graphs
• The enumeration of spanning tree of weighted graphs
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
• The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
• Linear algebraic techniques for weighted spanning tree enumeration
• Simplicial matrix-tree theorems
• Algebraic Graph Theory
• Algebraic Potential Theory on Graphs
• A simple formula for the number of spanning trees of line graphs
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

This page was built for publication: Counting spanning trees in almost complete multipartite graphs