Interlacing Properties for Hermitian Matrices Whose Graph is a Given Tree
DOI10.1137/S0895479804440359zbMATH Open1095.15009OpenAlexW2118851482MaRDI QIDQ5317656FDOQ5317656
Authors: C. M.da Fonseca 
Publication date: 19 September 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479804440359
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)
Cited In (11)
- On the number of P-vertices of some graphs
- Graphs and Hermitian matrices: Exact interlacing
- On the location of the eigenvalues of Jacobi matrices
- Location of the eigenvalues of weighted graphs with a cut edge
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- 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
- The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree
- Graphs and Hermitian matrices: eigenvalue interlacing
- Title not available (Why is that?)
- Realizations of interlacing by tree-patterned matrics
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)
