On minimally 2-(edge)-connected graphs with extremal spectral radius

Xiaodan Chen,Litao Guo

doi:10.1016/j.disc.2019.04.002

On minimally 2-(edge)-connected graphs with extremal spectral radius

Xiaodan Chen, Litao Guo

Open Access

https://doi.org/10.1016/j.disc.2019.04.002

Copy DOI

Journal: Discrete Mathematics	Publication Date: Apr 30, 2019
Citations: 6	License type: publisher-specific-oa

Affiliation: Guangxi University, Xiamen University of Technology

#Smallest Spectral Radius #Spectral Radius

Abstract
Full-Text
Similar Papers

Abstract

A graph is minimally 2-(edge)-connected if it is 2-(edge)-connected and deleting any arbitrary chosen edge always leaves a graph which is not 2-(edge)-connected. In this paper, we completely characterize the minimally 2-(edge)-connected graphs having the largest and the smallest spectral radius, respectively.

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

Similar Papers

Paper Title

Journal

Date

Author

More From: Discrete Mathematics

Paper Title

Journal

Date

Author

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.