On tricyclic graphs whose second largest eigenvalue does not exceed 1

A tricyclic graph of order n is a connected graph with n vertices and n + 2 edges. In this paper, all tricyclic graphs whose second largest eigenvalue does not exceed 1 are identified.