Edge version of the matrix tree theorem for trees
From MaRDI portal
Recommendations
Cites work
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- An edge version of the matrix-tree theorem and the wiener index
- An enumerating function for spanning forests with color restrictions
- Generalized matrix tree theorem for mixed graphs
- Moore-penrose inverse of the incidence matrix of a tree
- On the adjoint of a matrix associated with trees
Cited in
(15)- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- On spectral integral variations of mixed graphs
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Largest eigenvalue of a unicyclic mixed graphs
- The Laplacian eigenvalues of mixed graphs
- First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
- Nonsingular mixed graphs with few eigenvalues greater than two
- On eigenvectors of mixed graphs with exactly one nonsingular cycle
- Generalized matrix tree theorem for mixed graphs
- On the least eigenvalue of a unicyclic mixed graph
- scientific article; zbMATH DE number 825150 (Why is no real title available?)
- scientific article; zbMATH DE number 7274714 (Why is no real title available?)
- On weighted directed graphs
- The Laplacian spectrum of a mixed graph
- On edge singularity and eigenvectors of mixed graphs
This page was built for publication: Edge version of the matrix tree theorem for trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4498328)