The trees for which maximum multiplicity implies the simplicity of other eigenvalues

DOI10.1016/j.disc.2005.04.026zbMath1105.05013OpenAlexW1988234062MaRDI QIDQ856861

Carlos M. Saiago, Charles R. Johnson

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.04.026

zbMATH Keywords

real symmetric matricesvertex degrees

Mathematics Subject Classification ID

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

Cites Work

• Spectral multiplicity and splitting results for a class of qualitative matrices
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• 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 Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: The trees for which maximum multiplicity implies the simplicity of other eigenvalues