Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
From MaRDI portal
Publication:968196
DOI10.1016/j.dam.2009.11.009zbMath1225.05166OpenAlexW2062004190MaRDI QIDQ968196
Charles R. Johnson, David A. Sher, Christopher Jordan-Squire
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://scholarworks.wm.edu/aspubs/1241
Related Items (7)
Questions, conjectures, and data about multiplicity lists for trees ⋮ Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree ⋮ Sparks of symmetric matrices and their graphs ⋮ The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree ⋮ The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree ⋮ Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments ⋮ The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
Cites Work
- Unnamed Item
- Spectral multiplicity and splitting results for a class of qualitative matrices
- 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.
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Matrix Analysis
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- The Parter--Wiener Theorem: Refinement and Generalization
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- On the Eigenvalues and Eigenvectors of a Class of Matrices
This page was built for publication: Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
