Abstract
In this paper, we provide the smallest value of the second largest Laplacian eigenvalue for any unicyclic graph, and find the unicyclic graphs attaining that value. And also give an “asymptotically good” upper bounds for the second largest Laplacian eigenvalues of unicyclic graphs. Using this results, we can determine unicyclic graphs with maximum Laplacian separator. And unicyclic graphs with maximum Laplacian spread will also be determined.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
