论文信息 - On thek-th largest eigenvalue of the Laplacian matrix of a graph - 字舞流文

On thek-th largest eigenvalue of the Laplacian matrix of a graph

In this paper, we give the upper bound and lower bound ofk-th largest eigenvalue λk of the Laplacian matrix of a graphG in terms of the edge number ofG and the number of spanning trees ofG.

Zhang Xiaodong | Li Jiongsheng

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

[2] F. Chung. Eigenvalues of Graphs , 1995 .

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

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

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

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

[7] Joel Friedman,et al. Minimum higher eigenvalues of Laplacians on graphs , 1996 .

[8] Zhang Xiaodong,et al. A new upper bound for eigenvalues of the laplacian matrix of a graph , 1997 .

[9] Richard A. Brualdi,et al. Combinatorial matrix theory , 1991 .