Spectral bounds for the clique and independence numbers of graphs (Q1079582)

A sequence of bounds on the clique number of a graph is established. These depend on the eigenvalues and eigenvectors of the 0-1 adjacency matrix of the graph, and sharpen many existing spectral bounds. The proof lies on a result of \textit{T. S. Motzkin} and \textit{E. G. Straus} [Maxima for graphs and a new proof of a theorem of Turan, Can. J. Math. 17, 533- 540 (1965; Zbl 0129.399)] concerning the maximization of a certain quadratic form.