Eigenvalues and extremal degrees of graphs

Linear Algebra and Its Applications

Volumn 419, Issue 2-3, 2006, Pages 735-738

  Nikiforov, Vladimir ^a  

^a University of Memphis   (United States)

Author keywords

Conditions for quasi randomness; Graph eigenvalues; Laplacian eigenvalues; Maximum degree; Minimum degree; Quasi random graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; LINEAR ALGEBRA;

CONDITIONS FOR QUASI-RANDOMNESS; GRAPH EIGENVALUES; LAPLACIAN EIGENVALUES; MAXIMUM DEGREE; MINIMUM DEGREE; QUASI-RANDOM GRAPHS;

GRAPH THEORY;

EID: 33748912755     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.06.013     Document Type: Article

References (6)

1. Bollobás B. Modern Graph Theory. Graduate Texts in Mathematics 184 (1998), Springer-Verlag, New York xiv+394pp
2. Cvetković D., Doob M., and Sachs H. Spectra of Graphs (1980), VEB Deutscher Verlag der Wissenschaften, Berlin 368pp
3. Chung F.R.K., Graham R.L., and Wilson R.M. Quasi-random graphs. Combinatorica 9 (1989) 345-362
4. Grone R., and Merris R. The Laplacian spectrum of a graph (II). SIAM J. Discrete Math. 7 (1994) 221-229
5. Horn R., and Johnson C. Matrix Analysis (1985), Cambridge University Press, Cambridge xiii+561pp
6. Nikiforov V. Eigenvalues and degree deviation in graphs. Linear Algebra Appl. 414 (2006) 347-360