Abstract
The problem of characterizing graphs whose second largest eigenvalue does not exceed a comparatively small constant has attracted a great deal of attention in the last decades. Let T1,2 be the tree of diameter 3 with exactly 3 pendent vertices. In this paper, all connected T1,2-free planar graphs whose second largest eigenvalue does not exceed 1 are determined.
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
