An enumerating function for spanning forests with color restrictions

DOI10.1016/0024-3795(92)90431-9zbMath0804.05052OpenAlexW1986983842MaRDI QIDQ1194294

Ravindra 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

treesdiscriminantsprincipal minorscolormatrix-tree theoremspanning treesenumerating functionspanning forestsKirchhoff matrix

Mathematics Subject Classification ID

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

Related Items (4)

Combinatorial proofs of multivariate Cayley-Hamilton theorems ⋮ Edge version of the matrix tree theorem for trees ⋮ Forest matrices around the Laplacian matrix ⋮ Laplacian matrices of graphs: A survey

Cites Work

• Mixed discriminants of positive semidefinite matrices
• Unnamed Item
• Unnamed Item

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