Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

JCT
2007

favoriteEmaildiscussreport

146views more JCT 2007»

Laplacian spectral bounds for clique and independence numbers of graphs

13 years 4 months ago

Laplacian spectral bounds for clique and independence numbers of graphs

Download www.math.nankai.edu.cn

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.

Mei Lu, Huiqing Liu, Feng Tian

Real-time Traffic

JCT 2007 | Largest Clique | Simple Graph | Upper Bounds |

claim paper

Related Content

» New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory

» Complete Minors and Independence Number

» Spectral Densest Subgraph and Independence Number of a Graph

» Packing Cliques in Graphs with Independence Number 2

» RamseyType Results for Unions of Comparability Graphs

» Metric uniformization and spectral bounds for graphs

» Improved Approximations of Independent Sets in BoundedDegree Graphs

» Laplacian Spectrum of Weakly Quasithreshold Graphs

» Lasserre Hierarchy Higher Eigenvalues and Approximation Schemes for Quadratic Integer Prog...

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Mei Lu, Huiqing Liu, Feng Tian

Comments (0)