Title of article
The trees for which maximum multiplicity implies the simplicity of other eigenvalues Original Research Article
Author/Authors
Michael I. Gekhtman and Charles R. Johnson، نويسنده , , Carlos M. Saiago، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
6
From page
3130
To page
3135
Abstract
Among those real symmetric matrices whose graph is a given tree T, the maximum multiplicity is known to be the path cover number of T. An explicit characterization is given for those trees for which whenever the maximum multiplicity is attained, all other multiplicities are 1.
Keywords
Real symmetric matrices , Multiplicities , Maximum multiplicity , Trees , Vertex degrees , NIM trees , eigenvalues
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
947933
Link To Document