Bounds on eigenvalues and chromatic numbers

Linear Algebra and Its Applications

Volumn 270, Issue 1-3, 1998, Pages 1-13

  Cao, Dasong ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041853219     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(96)00199-1     Document Type: Article

References (11)

1. R. A. Brualdi and A. J. Hoffman, On the spectral radius of 0-1 matrices, Linear Algebra Appl. 65:133-146 (1985).
2. R. L. Brooks, On colouring the node of a network, Proc. Cambridge Philos. Soc. 37:194-197 (1941).
3. D. Cvetkovic, M. Doob, and H. Sachs, Spectra of Graphs, Academic, New York, 1980.
4. S. Friedland, Bounds on the spectral radius of graphs with e edges, Linear Algebra Appl. 101:81-86 (1988).
5. A. J. Hoffman, On eigenvalues and colourings of graphs, in Graph Theory and Its Applications (B. Harris, Ed.), Academic, pp. 78-91, 1970.
6. P. Rowlinson, On the maximal index of graphs with a prescribed number of edges, Linear Algebra Appl. 110:43-53 (1988).
7. A. J. Schwenk, New derivations of spectral bounds for the chromatic number, Graph Theory Newsletter 5(1):77 (1975).
8. R. P. Stanley, A bound on the spectral radius of graphs with e edges, Linear Algebra Appl. 87:267-269 (1987).
9. G. Szekeres and H. S. Wilf, An inequality for the chromatic number of a graph, J. Combin. Theory 4:1-3 (1968).
10. H. S. Wilf, The eigenvalues of a graph and its chromatic number, J. London Math. Soc. 42:330-332 (1967).
11. Hong Yuan, A bound on the spectral radius of graphs, Linear Algebra Appl. 108:135-139 (1988).