On bicyclic graphs whose second largest eigenvalue does not exceed 1

Connected graphs in which the number of edges equals the number of vertices plus one are called bicyclic graphs. In this paper, all bicyclic graphs whose second largest eigenvalue does not exceed 1 have been determined.