Abstract
We determine all connected {K1,3,K5−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 Petrović and Milekić (1998).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
