Abstract
The generalized ABC index of a graph G, denoted by ABCα(G), is defined as the sum of weights (di+dj−2didj)α over all edges vivj of G, where α is an arbitrary non-zero real number, and di is the degree of vertex vi of G. In this paper, we first prove that the generalized ABC index of a connected graph will increase with addition of edge(s) if α<0 or 0<α≤1∕2, which provides a useful tool for the study of extremal properties of the generalized ABC index. By means of this result, we then characterize the graphs having the maximal ABCα value for α<0 among all connected graphs with given order and vertex connectivity, edge connectivity, or matching number. Our work extends some previously known results.
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.
