Abstract
Suppose that T n c is a set, such that the elements of T n c are the complements of trees of order n . In 2012, Li and Wang gave the unique graph in the set T n c ∖ { K 1, n − 1 c } with minimum 1st ‘least eigenvalue of the signless Laplacian’ (abbreviated to a LESL). In the present work, we give the unique graph with 2nd LESL in T n c ∖ { K 1, n − 1 c } , where K 1, n − 1 c represents the complement of star of order n .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Electronic Journal of Graph Theory and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.