Abstract
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.
Similar content being viewed by others
References
D. Cvetković, M. Doob, H. Sachs: Spectra of Graphs, third ed. Johann Ambrosius Barth Verlag, Heidelberg-Leipzig, 1995.
M. Desai, V. Rao: A characterization of the smallest eigenvalue of a graph. J. Graph Theory 18 (1994), 181–194.
W. Haemers: Interlacing eigenvalues and graphs. Linear Algebra Appl. 227–228 (1995), 593–616.
W. Haemers, E. Spence: Enumeration of cospectral graph. Europ. J. Combin. 25 (2004), 199–211.
M. Lu, H. Liu, F. Tian: Laplacian spectral bounds for clique and independence numbers of graphs. J. Combin. Theory Ser. B 97 (2007), 726–732.
T. Motzkin, E. G. Straus: Maxima for graphs and a new proof of a theorem of Turén. Canad. J. Math. 17 (1965), 533–540.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (No. 10771080), SRFDP of China (No. 20070574006) and by the Foundation to the Educational Committee of Fujian (No. JB07020).
Rights and permissions
About this article
Cite this article
Liu, J., Liu, B. The maximum clique and the signless Laplacian eigenvalues. Czech Math J 58, 1233–1240 (2008). https://doi.org/10.1007/s10587-008-0082-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-008-0082-z