Some graphs whose second largest eigenvalue does not exceed

We determine all trees whose second largest eigenvalue does not exceed . Next, we consider two classes of bipartite graphs, regular and semiregular, with small number of distinct eigenvalues. For all graphs considered we determine those whose second largest eigenvalue is equal to . Some additional results are also given.