On graphs whose second largest eigenvalue is at most 1

Abstract We determine all connected { K 1 , 3 , K 5 − e } -free graphs whose second largest eigenvalue does not exceed 1. Our result includes all connected line graphs with the same spectral property, and therefore strengthens the result of Petrovic and Milekic (1998).