Article ID Journal Published Year Pages File Type
4651375 Discrete Mathematics 2006 6 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The trees for which maximum multiplicity implies the simplicity of other eigenvalues
Authors
, ,