An enumerating function for spanning forests with color restrictions

DOI10.1016/0024-3795(92)90431-9MaRDI QIDQ1194294zbMATH OpenOpenAlexFDO

Authors R. B. Bapat, Gregory M. Constantine

Publication date 27 September 1992

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

Full work available at URL https://doi.org/10.1016/0024-3795(92)90431-9

zbMATH Keywords

colordiscriminantsenumerating functionKirchhoff matrixmatrix-tree theoremprincipal minorsspanning forestsspanning treestrees

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Determinantal generating functions of colored spanning forests
• scientific article; zbMATH DE number 1043869
• Linear algebraic techniques for spanning tree enumeration
• scientific article; zbMATH DE number 2076810
• scientific article; zbMATH DE number 1786671

Cites work

• scientific article; zbMATH DE number 1043869 (Why is no real title available?)
• scientific article; zbMATH DE number 3999929 (Why is no real title available?)
• Mixed discriminants of positive semidefinite matrices

Cited in

(6)

• Laplacian matrices of graphs: A survey
• Determinantal generating functions of colored spanning forests
• Forest matrices around the Laplacian matrix
• Combinatorial proofs of multivariate Cayley-Hamilton theorems
• scientific article; zbMATH DE number 6700486 (Why is no real title available?)
• Edge version of the matrix tree theorem for trees

This page was built for publication: An enumerating function for spanning forests with color restrictions

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