Maximum Atom-Bond Sum-Connectivity Index of n-Order Trees With Fixed Number of Leaves

Abstract

Let G be a graph. For an edge e of G , denote by d e the number of edges adjacent to e . The atom-bond sum-connectivity (ABS) index of G is defined as ABS ( G ) = (cid:80) e ∈ E ( G ) (cid:112) 1 − 2( d e + 2) − 1 . A graph of order n is known as an n -order graph. The problem of determining trees possessing the minimum ABS index among all n -order trees with fixed number of leaves has recently been attacked in two preprints independently. This article provides a complete solution to the maximal version of the aforementioned problem