On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
From MaRDI portal
Publication:1870050
DOI10.1016/S0024-3795(01)00589-4zbMath1022.15030MaRDI QIDQ1870050
Andrew J. Witt, Carlos M. Saiago, Charles R. Johnson, António Leal-Duarte, Brian D. Sutton
Publication date: 4 May 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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, Computation of minimal rank and path cover number for certain graphs, The trees for which maximum multiplicity implies the simplicity of other eigenvalues, On the minimum rank of the join of graphs and decomposable graphs, Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue, On the number of P-vertices of some graphs, Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree, Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree, 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., Sets of Parter vertices which are Parter sets, On Fiedler- and Parter-vertices of acyclic matrices, A note on the multiplicities of the eigenvalues of a graph, On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree, The structure of matrices with a maximum multiplicity eigenvalue, Change in vertex status after removal of another vertex in the general setting, Eigenvalue assignments and the two largest multiplicities 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, Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree, Maximal P-sets of matrices whose graph is a tree, Smith normal form and acyclic matrices, Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments, Non-singular acyclic matrices, Implicit construction of multiple eigenvalues for trees, All pairs suffice for a P-set, Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Cites Work
