Spectral bounds for the clique and independence numbers of graphs

Journal of Combinatorial Theory, Series B

Volumn 40, Issue 1, 1986, Pages 113-117

  Wilf, Herbert S ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249042332     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/0095-8956(86)90069-9     Document Type: Article

References (9)

1. The Eigenvalues of a Graph and Its Chromatic Number
2. Maxima for graphs and a new proof of a theorem of Turán
3. Chromatic number and the spectrum of a graph
4. Some properties of the spectrum of a graph
5. Polynomial solvability of convex quadratic programming