Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph
From MaRDI portal
(Redirected from Publication:1906249)
For a digraph \(G\) let \(D(G)\) be the digraph whose vertices are all oriented rooted spanning trees of \(G\) with arcs connecting vertices corresponding to oriented rooted spanning trees which can be obtained one from the other by a local transformation defined in the paper. The author relates eigenvalues of \(D(G)\) to eigenvalues of induced subgraphs of \(G\) and to Laplacian eigenvalues of \(G\).
Recommendations
Cites work
Cited in
(7)- On the characteristic polynomial and eigenvectors in terms of the tree-like structure of a digraph
- A combinatorial proof of a formula of Biane and Chapuy
- Laplacian matrices and spanning trees of tree graphs
- Geometric and spectral analysis on weighted digraphs
- Invariants for incidence matrix of a tree
- Locally Markov walks on finite graphs
- Functions of random walks on hyperplane arrangements
This page was built for publication: Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906249)