Abstract
A connected graph G is a cactus if any two of its cycles have at most one common vertex. Denote by the set of n-vertex cacti with matching number q. Huang, Deng and Simić [23] identified the unique graph with the maximum spectral radius among 2q-vertex cacti with perfect matchings. In this paper, as a continuance of it, the largest and second largest spectral radii together with the corresponding graphs among are determined. Consequently, the first two largest spectral radii together with cacti having perfect matchings are also 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.
