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

Let G be a graph.For an edge e of G, denote by de the number of edges adjacent to e.The atom-bond sum-connectivity (ABS) index of G is defined as ABS(G) = e∈E(G) 1 -2(de + 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.