Abstract
Let n≥29,k≥2 and δ≥1 be three positive integers, where n≥k+2 and n≡k(mod2). In this paper, we characterize the extremal graphs with maximum spectral radius among all connected graphs on n vertices with minimum degree δ and matching number at most n−k2. This solves an open problem proposed in [10].
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.
