The Laplacian Spread of a Tree

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we show that the star is the unique tree with maximal Laplacian spread among all trees of given order, and the path is the unique one with minimal Laplacian spread among all trees of given order.

[1]  Russell Merris,et al.  The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..

[2]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[3]  ChenYan.  PROPERTIES OF SPECTRA OF GRAPHS AND LINE GRAPHS , 2002 .

[4]  T. D. Morley,et al.  Eigenvalues of the Laplacian of a graph , 1985 .

[5]  Tin-Yau Tam,et al.  On the spread of a hermitian matrix and a conjecture of thompson , 1994 .

[6]  Henry Wolkowicz,et al.  Lower bounds for the spread of a matrix , 1985 .

[7]  Robert C. Thompson.  The eigenvalue spreads of a hermitian matrix and its principal submatrices , 1992 .

[8]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

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

[10]  Bo Zhou,et al.  The spread of unicyclic graphs with given size of maximum matchings , 2007 .

[11]  Kinkar Ch. Das,et al.  An improved upper bound for Laplacian graph eigenvalues , 2003 .

[12]  Vladimir Nikiforov,et al.  Linear combinations of graph eigenvalues , 2006, math/0608198.

[13]  David A. Gregory,et al.  The spread of the spectrum of a graph , 2001 .

[14]  R. Merris.  Characteristic vertices of trees , 1987 .

[15]  L. Mirsky,et al.  The spread of a matrix , 1956 .

[16]  M. SIAMJ.,et al.  EXTREMAL EIGENVALUES OF REAL SYMMETRIC MATRICES WITH ENTRIES IN AN INTERVAL ∗ , 2006 .

[17]  Chen Yan,et al.  Properties of spectra of graphs and line graphs , 2002 .

[18]  V. Sunder,et al.  The Laplacian spectrum of a graph , 1990 .