Factorizations of some weighted spanning tree enumerators

DOI10.1016/J.JCTA.2003.08.003zbMath1032.05084arXivmath/0302213OpenAlexW2103165842WikidataQ114162761 ScholiaQ114162761MaRDI QIDQ1421333

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

zbMATH Keywords

Spanning treeMatrix-tree theoremGraph Laplacian

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees and function classes
• Advanced determinant calculus
• Degree maximal graphs are Laplacian integral

Related Items (12)

Characterisation and classification of signatures of spanning trees of the $n$-cube ⋮ Spanning tree enumeration and nearly triangular graph Laplacians ⋮ A bijective enumeration of labeled trees with given indegree sequence ⋮ The uncover process for random labeled trees ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ Unnamed Item ⋮ Cellular spanning trees and laplacians of cubical complexes ⋮ Laplacian matrices and spanning trees of tree graphs ⋮ A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes ⋮ The enumeration of spanning tree of weighted graphs ⋮ Simplicial matrix-tree theorems ⋮ Linear algebraic techniques for weighted spanning tree enumeration

Uses Software

• Unnamed Item

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