Geodesic
The path is the tree with smallest greatest Laplacian eigenvalue
Kragujevac Journal of Mathematics, Tome 24 (2002) no. 1 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

Kragujevac J. Math. 24 (2002) 67-70. THE PATH IS THE TREE WITH SMALLEST GREATEST LAPLACIAN EIGENVALUEMiroslav Petrovic and Ivan Gutman Faculty of Science, P. O. Box 60, 34000 Kragujevac, Yugoslavia (Received August 23, 2002) Abstract. It is shown that among all trees with a fixed number of vertices the path has the smallest value of the greatest Laplacian eigenvalue. 
@article{KJM_2002_24_1_a6,
     author = {Miroslav Petrovi\'c and Ivan Gutman},
     title = {The path is the tree with smallest greatest {Laplacian} eigenvalue},
     journal = {Kragujevac Journal of Mathematics},
     pages = {67 - 70},
     year = {2002},
     volume = {24},
     number = {1},
     url = {http://geodesic.mathdoc.fr/item/KJM_2002_24_1_a6/}
}
TY  - JOUR
AU  - Miroslav Petrović
AU  - Ivan Gutman
TI  - The path is the tree with smallest greatest Laplacian eigenvalue
JO  - Kragujevac Journal of Mathematics
PY  - 2002
SP  - 67 
EP  -  70
VL  - 24
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/KJM_2002_24_1_a6/
ID  - KJM_2002_24_1_a6
ER  - 
%0 Journal Article
%A Miroslav Petrović
%A Ivan Gutman
%T The path is the tree with smallest greatest Laplacian eigenvalue
%J Kragujevac Journal of Mathematics
%D 2002
%P 67 - 70
%V 24
%N 1
%U http://geodesic.mathdoc.fr/item/KJM_2002_24_1_a6/
%F KJM_2002_24_1_a6
Miroslav Petrović; Ivan Gutman. The path is the tree with smallest greatest Laplacian eigenvalue. Kragujevac Journal of Mathematics, Tome 24 (2002) no. 1. http://geodesic.mathdoc.fr/item/KJM_2002_24_1_a6/