Generalized matrix tree theorem for mixed graphs
From MaRDI portal
The well-known matrix tree theorem is generalized by giving a graph-theoretical interpretation of all minors of the Laplacean matrix of a mixed graph (a graph with some oriented and some unoriented edges).
Recommendations
Cites work
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Edge version of the matrix tree theorem for trees
- Graph theory with applications
- scientific article; zbMATH DE number 3999929 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- On the minors of an incidence matrix and Smith normal form
Cited in
(46)- On the maximal signless Laplacian spectral radius of graphs with given matching number
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- A generalization of the all minors matrix tree theorem to semirings
- On spectral integral variations of mixed graphs
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Principal minor version of matrix-tree theorem for mixed graphs
- Largest eigenvalue of a unicyclic mixed graphs
- Forest matrices around the Laplacian matrix
- The Laplacian eigenvalues of mixed graphs
- Skewed converse and Laplacian spectral radius of weighted directed graphs
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals
- First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
- Nonsingular mixed graphs with few eigenvalues greater than two
- On the determinant of the Laplacian matrix of a complex unit gain graph
- On minors of the compound matrix of a Laplacian
- Line star sets for Laplacian eigenvalues
- Distance matrix and Laplacian of a tree with attached graphs
- Some families of integral mixed graphs
- Extremizing first eigenvalue of 3-colored digraphs made with given blocks
- On the spectrum of 3-coloured digraphs
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- On eigenvectors of mixed graphs with exactly one nonsingular cycle
- Spectral integral variation and unicyclic 3-colored digraphs with second smallest eigenvalue 1
- Edge version of the matrix tree theorem for trees
- scientific article; zbMATH DE number 1538963 (Why is no real title available?)
- Inverses of non-bipartite unicyclic graphs with a unique perfect matching
- Minors of Hermitian (quasi-) Laplacian matrix of a mixed graph
- scientific article; zbMATH DE number 7274714 (Why is no real title available?)
- An elementary proof of a matrix tree theorem for directed graphs
- Matrices with zero row sums, tree theorems and a Markov chain on trees
- Algebraic connectivity of directed graphs
- Identities for minors of the Laplacian, resistance and distance matrices
- On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs
- Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs
- On cospectral oriented graphs and cospectral signed graphs
- More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs
- On spectral invariants of the -mixed adjacency matrix
- On weighted directed graphs
- On principal minors and determinants of complex Laplacian and complex signless Laplacian matrices of multidigraphs
- Relation between the H-rank of a mixed graph and the girth of its underlying graph
- The Laplacian spectrum of a mixed graph
- New matrices for the spectral theory of mixed graphs. II
- Matrix-tree theorems for complex unit gain networks
- On edge singularity and eigenvectors of mixed graphs
- Unoriented Laplacian maximizing graphs are degree maximal
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
This page was built for publication: Generalized matrix tree theorem for mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3836208)
