Abstract

In this paper it is shown that the characterizations of trees and unicyclic graphs having a given matching number and minimum connectivity index χ−1∕2, proposed by Du et al. (2010) remain valid for general connectivity index χα if −1≤α<0 for trees and −0.585≤α<0 for unicyclic graphs. The extremal result for trees having a given matching number is also true for the harmonic index H, since for any graph H(G)=2χ−1(G) holds.

Full Text
Paper version not known

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

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.