A result related to the largest eigenvalue of a tree
Gurusamy Rengasamy Vijayakumar (2008)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we prove that {0,1,√2,√3,2} is the set of all real numbers l such that the following holds: every tree having an eigenvalue which is larger than l has a subtree whose largest eigenvalue is l.