Eigenvalues and extremal degrees in graphs
  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. 
Vladimir Nikiforov