Laplacian spectral bounds for clique and independence numbers of graphs

Authors:
Mei Lu;Huiqing Liu;Feng Tian
Affiliations:
Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China;School of Mathematics and Computer Science, Hubei University, Wuhan 430062, China;Institute of Systems Science, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing 100080, China
Venue:
Journal of Combinatorial Theory Series B
Year:
2007

Citing 5
Cited 3

Spectral bounds for the clique and independence numbers of graphs

Journal of Combinatorial Theory Series B
Isoperimetric numbers of graphs

Journal of Combinatorial Theory Series B
The Laplacian Spectrum of a Graph II

SIAM Journal on Discrete Mathematics
An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian

SIAM Journal on Discrete Mathematics
Eigenvalue bounds for independent sets

Journal of Combinatorial Theory Series B

Eigenvalue bounds for independent sets

Journal of Combinatorial Theory Series B
More spectral bounds on the clique and independence numbers

Journal of Combinatorial Theory Series B
A new spectral bound on the clique number of graphs

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.