Abstract
The atom-bond sum-connectivity (ABS) index of a graph is a variant from some famous chemical topological indices such as the Randić index, the sum-connectivity index and the atom-bond connectivity index. The research on its extremal problems of a graph has much theoretical value and application background.Let Tn,m and T(n,γ) be the sets of all trees on n vertices with given matching number m and given dominating number γ, respectively. In this paper, we firstly determine the sharp upper bound of the ABS index among Tn,m and characterize the corresponding extremal graph. Secondly, we determine the sharp upper and lower bounds of the ABS index among T(n,γ) by using the bridge of the matching theory. Finally, the corresponding topological structures of their extremal graphs are characterized, respectively.
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.
