Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
From MaRDI portal
Publication:5317656
Recommendations
- scientific article; zbMATH DE number 2203299
- Realizations of interlacing by tree-patterned matrics
- Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
- The number of interlacing equalities resulting from removal of a vertex from a tree
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
Cited in
(12)- Interlacing property of zeros of eigenvectors of Schrödinger operators on trees
- On the number of P-vertices of some graphs
- Graphs and Hermitian matrices: Exact interlacing
- On the location of the eigenvalues of Jacobi matrices
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Location of the eigenvalues of weighted graphs with a cut edge
- Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree
- An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
- Graphs and Hermitian matrices: eigenvalue interlacing
- scientific article; zbMATH DE number 2203299 (Why is no real title available?)
- Realizations of interlacing by tree-patterned matrics
- The number of interlacing equalities resulting from removal of a vertex from a tree
This page was built for publication: Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317656)