The maximum clique and the signless Laplacian eigenvalues

被引：0

作者：

Jianping Liu

Bolian Liu

机构：

[1] Fuzhou University,College of Mathematics and Computer Science

[2] South China Normal University,School of Mathematics Sciences

来源：

Czechoslovak Mathematical Journal | 2008年 / 58卷

关键词：

bound; clique number; independence number; signless Laplacian eigenvalues;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Lower and upper bounds are obtained for the clique number ω(G) and the independence number α(G), in terms of the eigenvalues of the signless Laplacian matrix of a graph G.

引用

页码：1233 / 1240

页数：7

共 10 条

[1]

Desai M.(1994)A characterization of the smallest eigenvalue of a graph J. Graph Theory 18 181-194

[2]

Rao V.(1995)Interlacing eigenvalues and graphs Linear Algebra Appl. 227–228 593-616

[3]

Haemers W.(2004)Enumeration of cospectral graph Europ. J. Combin. 25 199-211

[4]

Haemers W.(2007)Laplacian spectral bounds for clique and independence numbers of graphs J. Combin. Theory Ser. B 97 726-732

[5]

Spence E.(1965)Maxima for graphs and a new proof of a theorem of Turén Canad. J. Math. 17 533-540

[6]

Lu M.(undefined)undefined undefined undefined undefined-undefined

[7]

Liu H.(undefined)undefined undefined undefined undefined-undefined

[8]

Tian F.(undefined)undefined undefined undefined undefined-undefined

[9]

Motzkin T.(undefined)undefined undefined undefined undefined-undefined

[10]

Straus E. G.(undefined)undefined undefined undefined undefined-undefined

← 1 →