The structure of matrices with a maximum multiplicity eigenvalue
From MaRDI portal
Publication:932157
DOI10.1016/j.laa.2008.04.016zbMath1143.15005OpenAlexW2082421003MaRDI QIDQ932157
Carlos M. Saiago, Charles R. Johnson, António Leal-Duarte
Publication date: 10 July 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/4579
Hermitian matriceseigenvaluestreesmultiplicitiespath cover numbermaximum multiplicityParter vertices
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items
The change in multiplicity of an eigenvalue due to adding or removing edges, The change in eigenvalue multiplicity associated with perturbation of a diagonal entry, Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue, Gallai-Edmonds structure theorem for weighted matching polynomial, The number of \(P\)-vertices in a matrix with maximum nullity, On edge star sets in trees, Diameter minimal trees, The number of distinct eigenvalues for which an index decreases multiplicity, The number of P-vertices for acyclic matrices of maximum nullity
Cites Work
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- A characterization of tridiagonal matrices
- Minimum-rank matrices with prescribed graph
- Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- Matrix Analysis
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- The Parter--Wiener Theorem: Refinement and Generalization
- Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
- Unnamed Item