Factorizations of some weighted spanning tree enumerators
From MaRDI portal
Publication:1421333
DOI10.1016/j.jcta.2003.08.003zbMath1032.05084arXivmath/0302213WikidataQ114162761 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
Related Items
Characterisation and classification of signatures of spanning trees of the $n$-cube, The uncover process for random labeled trees, Counting spanning trees of \((1, N\))-periodic graphs, Cellular spanning trees and laplacians of cubical complexes, A bijective enumeration of labeled trees with given indegree sequence, A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes, Laplacian matrices and spanning trees of tree graphs, The enumeration of spanning tree of weighted graphs, Spanning tree enumeration and nearly triangular graph Laplacians, Linear algebraic techniques for weighted spanning tree enumeration, Simplicial matrix-tree theorems
Uses Software
Cites Work