Some inequalities for the largest eigenvalue of a graph

Combinatorics Probability and Computing

Volumn 11, Issue 2, 2002, Pages 179-189

  Nikiforov, V ^a  

^a University of Memphis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING; VECTORS;

ADJACENCY MATRIX; BIPARTITE GRAPH; UPPER BOUNDS;

GRAPH THEORY;

EID: 0036524595     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548301004928     Document Type: Article

References (21)

1. Bell, F. (1992) Note on the irregularity of graphs. Linear Alg. Appl. 161 45-54.
2. Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
3. Collatz, L. and Sinogowitz, U. (1957) Spektren endlicher Grafen. Abh. Math. Sem. Univ. Hamburg 21 63-77.
4. Cvetković, D. (1972) Chromatic number and the spectrum of a graph. Publ. Inst. Math. (Beograd) 14 25-38.
5. Cvetković, D., Doob, M. and Sachs, H. (1980) Spectra of Graphs, VEB Deutscher Verlag der Wissenschaften, Berlin.
6. Edwards, C. and Elphick, C. (1983) Lower bounds for the clique and the chromatic number of a graph. Discr. Appl. Math. 5 51-64.
7. Fisher, D. and Ryan, J. (1992) Bounds on the number of complete subgraphs. Discr. Math. 103 313-320.
8. Hofmeister, M. (1988) Spectral radius and degree sequence. Math. Nachr. 139 37-44.
9. Hong, Y. (1993) Bounds of eigenvalues of graphs. Discr. Math. 123 65-74.
10. Hong, Y. (1995) On the spectral radius and the genus of graphs. J. Combin. Theory Ser. B 65 262-268.
11. Hong, Y. and Shu, J. (2000) A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type. Discr. Math. 211 229-232.
12. Khadziivanov, N. (1977) Inequalities for graphs. C. R. Acad. Sci. Bul. 30 793-796. In Russian.
13. Li, X. (1996) The relations between the spectral radius of the graphs and their complements. J. North China Technol. Inst. 17 297-299.
14. Motzkin, T. and Straus, E. (1965) Maxima for graphs and a new proof of a theorem of Turán. Canad. J. Math. 17 533-540.
15. Nikiforov, V. Inequalities for graphs with restricted clique number. To appear.
16. Nosal, E. (1970) Eigenvalues of graphs. Master's thesis, University of Calgary.
17. Rowlinson, P. (1988) On the maximal index of graphs with a prescribed number of edges. Linear Alg. Appl. 110 43-53.
18. Stanley, R. (1987) A bound on the spectral radius of graphs with e edges. Linear Alg. Appl. 87 267-269.
19. Wilf, H. (1967) The eigenvalues of a graph and its chromatic number. J. London Math. Soc. 42 330-332.
20. Wilf, H. (1986) Spectral bounds for the clique and independence numbers of graphs. J. Combin. Theory Ser. B 40 113-117.
21. Zhou, B. (1997) A note about the relations between the spectral radius of graphs and their complements. Pure Appl. Math. 13 15-18.