The number of distinct eigenvalues for which an index decreases multiplicity
DOI10.1016/J.LAA.2016.11.033zbMATH Open1352.15013OpenAlexW2553108772MaRDI QIDQ730608FDOQ730608
Authors: Charles R. Johnson, António Leal Duarte, Carlos M. Saiago 
Publication date: 28 December 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.11.033
Recommendations
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- The number of interlacing equalities resulting from removal of a vertex from a tree
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Matrix Analysis
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- The Parter--Wiener Theorem: Refinement and Generalization
- Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
- Diameter minimal trees
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- The structure of matrices with a maximum multiplicity eigenvalue
- Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
Cited In (3)
This page was built for publication: The number of distinct eigenvalues for which an index decreases multiplicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730608)
