Laplacian spectral bounds for clique and independence numbers of graphs

Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In this paper, we present some new lower and upper bounds for the clique number ω(G) and the independence number α(G) involving the Laplacian eigenvalues of the graph G.

• Type: Journal
• Year: 2007
• Where: JCT
• Authors: Mei Lu, Huiqing Liu, Feng Tian
• Keywords: JCT 2007, Largest Clique, Simple Graph, Upper Bounds