Factorizations of some weighted spanning tree enumerators

DOI10.1016/J.JCTA.2003.08.003MaRDI QIDQ1421333zbMATH OpenOpenAlexWikidataFDO

Authors Jeremy L. Martin, Victor Reiner

Publication date 26 January 2004

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0302213, http://hdl.handle.net/1808/6354

zbMATH Keywords

Spanning treeMatrix-tree theoremGraph Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Abstract: We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with the technique of identification of factors.

Recommendations

• Linear algebraic techniques for weighted spanning tree enumeration
• The enumeration of spanning tree of weighted graphs
• Enumerating spanning trees of graphs with an involution
• A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes
• scientific article; zbMATH DE number 2076810

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1557063 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• Advanced determinant calculus
• Degree maximal graphs are Laplacian integral
• Spanning trees and function classes

Cited in

(14)

• Counting spanning trees of \((1, N\))-periodic graphs
• scientific article; zbMATH DE number 6719620 (Why is no real title available?)
• Cellular spanning trees and laplacians of cubical complexes
• Linear algebraic techniques for weighted spanning tree enumeration
• The uncover process for random labeled trees
• The enumeration of spanning tree of weighted graphs
• Simplicial matrix-tree theorems
• Characterisation and classification of signatures of spanning trees of the \(n\)-cube
• A bijective enumeration of labeled trees with given indegree sequence
• Enumerating spanning trees of graphs with an involution
• Laplacian matrices and spanning trees of tree graphs
• A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes
• Spanning tree enumeration and nearly triangular graph Laplacians
• scientific article; zbMATH DE number 5003363 (Why is no real title available?)

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: Factorizations of some weighted spanning tree enumerators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1421333)