论文信息 - Laplacian spectral bounds for clique and independence numbers of graphs

Laplacian spectral bounds for clique and independence numbers of graphs

In this paper, we present lower and upper bounds for the independence number @a(G) and the clique number @w(G) involving the Laplacian eigenvalues of the graph G.

[1] Herbert S. Wilf,et al. Spectral bounds for the clique and independence numbers of graphs , 1986, J. Comb. Theory, Ser. B.

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

[3] Chris D. Godsil,et al. Eigenvalue bounds for independent sets , 2008, J. Comb. Theory, Ser. B.

[4] W. Haemers. Interlacing eigenvalues and graphs , 1995 .

[5] Michael Doob,et al. Spectra of graphs , 1980 .

[6] Rong Luo,et al. The spectral radius of triangle-free graphs , 2002, Australas. J Comb..

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

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

[9] T. Motzkin,et al. Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[10] Bojan Mohar,et al. Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

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

[12] Oscar Rojo,et al. An always nontrivial upper bound for Laplacian graph eigenvalues , 2000 .

[13] F. Chung. Diameters and eigenvalues , 1989 .

[14] Fan Chung Graham,et al. An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian , 1994, SIAM J. Discret. Math..