Abstract
A 2-connected graph G is minimally 2-connected if deleting any arbitrary chosen edge of G always leaves a graph which is not 2-connected. In this paper, we give sharp upper bounds for the Laplacian spectral radius of (minimally) 2-connected graphs with given size, and determine the corresponding extremal graphs.
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.
