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. © 2008 Mathematical Institute, Academy of Sciences of Czech Republic.
Author supplied keywords
Cite
CITATION STYLE
APA
Liu, J., & Liu, B. (2008). The maximum clique and the signless Laplacian eigenvalues. Czechoslovak Mathematical Journal, 58(4), 1233–1240. https://doi.org/10.1007/s10587-008-0082-z
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free