Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix

DOI10.13001/1081-3810.1070zbMath0999.15005MaRDI QIDQ2782047

Charles R. Johnson, Carlos M. Saiago

Publication date: 14 April 2002

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122186

zbMATH Keywords

tree; algorithm; multiplicity; eigenvalue; symmetric matrix; vertex degrees

Mathematics Subject Classification ID

05C05: Trees

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

15B57: Hermitian, skew-Hermitian, and related matrices

05C07: Vertex degrees

Related Items

The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample, Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns, The trees for which maximum multiplicity implies the simplicity of other eigenvalues, On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree, The structure of matrices with a maximum multiplicity eigenvalue, Tree decomposition by eigenvectors, The minimum rank of symmetric matrices described by a graph: a survey, 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., Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues