Geodesic
A result related to the largest eigenvalue of a tree
Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 3, pp. 557-561

Voir la notice de l'article provenant de la source Library of Science

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.
Keywords: eigenvalues of a graph, characteristic polynomial 
@article{DMGT_2008_28_3_a13,
     author = {Vijayakumar, Gurusamy},
     title = {A result related to the largest eigenvalue of a tree},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {557--561},
     publisher = {mathdoc},
     volume = {28},
     number = {3},
     year = {2008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2008_28_3_a13/}
}
TY  - JOUR
AU  - Vijayakumar, Gurusamy
TI  - A result related to the largest eigenvalue of a tree
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2008
SP  - 557
EP  - 561
VL  - 28
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2008_28_3_a13/
LA  - en
ID  - DMGT_2008_28_3_a13
ER  - 
%0 Journal Article
%A Vijayakumar, Gurusamy
%T A result related to the largest eigenvalue of a tree
%J Discussiones Mathematicae. Graph Theory
%D 2008
%P 557-561
%V 28
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2008_28_3_a13/
%G en
%F DMGT_2008_28_3_a13
Vijayakumar, Gurusamy. A result related to the largest eigenvalue of a tree. Discussiones Mathematicae. Graph Theory, Tome 28 (2008) no. 3, pp. 557-561. http://geodesic.mathdoc.fr/item/DMGT_2008_28_3_a13/