Notes on the second largest eigenvalue of a graph

For a fixed real number r we give several necessary and/or sufficient conditions for a graph to have the second largest eigenvalue of the adjacency matrix, or signless Laplacian matrix, less then or equal to r.