论文信息 - THE PATH IS THE TREE WITH SMALLEST GREATEST LAPLACIAN EIGENVALUE - 字舞流文

THE PATH IS THE TREE WITH SMALLEST GREATEST LAPLACIAN EIGENVALUE

It is shown that among all trees with a fixed number of vertices the path has the smallest value of the greatest Laplacian eigenvalue.

Ivan Gutman | I. Gutman

[1] Ivan Gutman,et al. Chemical applications of the Laplacian spectrum of molecular graphs: Studies of the Wiener number , 1994 .

[2] Michael William Newman,et al. The Laplacian spectrum of graphs , 2001 .

[3] I. Gutman,et al. The largest eigenvalues of adjacency and Laplacian matrices, and ionization potentials of alkanes , 2002 .

[4] L. Lovász,et al. On the eigenvalues of trees , 1973 .

[5] Ivan Gutman,et al. Chemical applications of the Laplacian spectrum. VI On the largest Laplacian eigenvalue of alkanes , 2002 .

[6] Mirko Lepovic,et al. The high-energy band in the photoelectron spectrum of alkanes and its dependence on molecular structure , 1999 .

[7] R. Merris. A survey of graph laplacians , 1995 .

[8] B. Mohar. THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[9] Changan. SOME PROPERTIES OF THE SPECTRUM OF GRAPHS , 1999 .

[10] R. Merris. Laplacian matrices of graphs: a survey , 1994 .

[11] D. Cvetkovic,et al. Spectra of graphs : theory and application , 1995 .