arXiv Analytics

Sign in

arXiv:math/0605071 [math.CO]AbstractReferencesReviewsResources

Eigenvalues and extremal degrees in graphs

Vladimir Nikiforov

Published 2006-05-02Version 2

We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.

Categories: math.CO
Subjects: 05C50
Related articles: Most relevant | Search more
arXiv:1301.0374 [math.CO] (Published 2013-01-03, updated 2013-01-05)
The triangle-free graphs with rank 6
arXiv:1709.00182 [math.CO] (Published 2017-09-01)
On the eigenvalues of $A_α$-spectra of graphs
arXiv:math/0201211 [math.CO] (Published 2002-01-22)
The kernel of the adjacency matrix of a rectangular mesh

Links

Toolbox