ON THE κ-th LARGEST EIGENVALUE OF THE LAPLACIAN MATRIX OF A GRAPH     Laplacian matrix  eigenvalue         font style='font-size:12px;'> 2007/12/10

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

存档文本 原文地址 文献传递