Factorizations of some weighted spanning tree enumerators

DOI10.1016/J.JCTA.2003.08.003zbMATH Open1032.05084arXivmath/0302213OpenAlexW2103165842WikidataQ114162761 ScholiaQ114162761MaRDI QIDQ1421333FDOQ1421333

Authors: Jeremy L. Martin, Victor Reiner 

Publication date: 26 January 2004

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

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.

Full work available at URL: https://arxiv.org/abs/math/0302213

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

zbMATH Keywords

Spanning treeMatrix-tree theoremGraph Laplacian

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Advanced determinant calculus
• Degree maximal graphs are Laplacian integral
• Title not available (Why is that?)
• Spanning trees and function classes

Cited In (14)

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

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)