Linear algebraic techniques for weighted spanning tree enumeration

DOI10.1016/j.laa.2019.08.009zbMath1426.05069arXiv1903.03575OpenAlexW2922387598WikidataQ127358319 ScholiaQ127358319MaRDI QIDQ2332392

Steven Klee, Matthew T. Stamps

Publication date: 4 November 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

Schur complementsmatrix-tree theoremmatrix determinant lemmaweighted spanning trees

Mathematics Subject Classification ID

Trees (05C05) Determinants, permanents, traces, other special matrix functions (15A15) Enumeration in graph theory (05C30) Signed and weighted graphs (05C22)

Related Items (9)

Spanning tree enumeration and nearly triangular graph Laplacians ⋮ Biconed graphs, weighted forests, and \(h\)-vectors of matroid complexes ⋮ Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest ⋮ Counting spanning trees with a Kekulé structure in linear hexagonal chains ⋮ Unnamed Item ⋮ A combinatorial expression for the group inverse of symmetric \(M\)-matrices ⋮ Linear Algebraic Techniques for Spanning Tree Enumeration ⋮ Counting spanning trees in almost complete multipartite graphs ⋮ Linear algebraic techniques for weighted spanning tree enumeration

Cites Work

• The number of spanning trees of a complete multipartite graph
• Degree maximal graphs are Laplacian integral
• Factorizations of some weighted spanning tree enumerators
• Enumerative properties of Ferrers graphs
• Threshold graphs and related topics
• Linear algebraic techniques for weighted spanning tree enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear algebraic techniques for weighted spanning tree enumeration