Kragujevac J. Math. 24 (2002) 67-70.

THE PATH IS THE TREE WITH SMALLEST GREATEST LAPLACIAN EIGENVALUE

Miroslav 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.