scientific article; zbMATH DE number 7771742

zbMath1524.05156MaRDI QIDQ6072058

Unnamed Author, Weigen Yan

Publication date: 29 November 2023

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/87/ajc_v87_p357.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complete bipartite graph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerating spanning trees of graphs with an involution
• Enumerative properties of Ferrers graphs
• The enumeration of spanning tree of weighted graphs
• Counting spanning trees in almost complete multipartite 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
• 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
• Counting spanning trees in a complete bipartite graph which contain a given spanning forest