Bounds on graph spectra

The largest eigenvalue of the adjacency matrix of a graph has received considerable attention in the literature. Not nearly as much seems to be known about bounds on other eigenvalues of the spectrum. Several results are presented here toward that goal, first for the general class of simple graphs, then for triangle-free graphs and finally for the even more restricted class of bipartite graphs.