The minimal-ABC trees with B(1)-branches

The atom-bond connectivity index (or, for short, ABC index) is a molecular structure descriptor bridging chemistry to graph theory. It is probably the most studied topological index among all numerical parameters of a graph that characterize its topology. For a given graph G = (V, E), the ABC index of G is defined as [Image: see text] , where d(i) denotes the degree of the vertex i, and ij is the edge incident to the vertices i and j. A combination of physicochemical and the ABC index properties are commonly used to foresee the bioactivity of different chemical composites. Additionally, the applicability of the ABC index in chemical thermodynamics and other areas of chemistry, such as in dendrimer nanostars, benzenoid systems, fluoranthene congeners, and phenylenes is well studied in the literature. While finding of the graphs with the greatest ABC-value is a straightforward assignment, the characterization of the tree(s) with minimal ABC index is a problem largely open and has recently given rise to numerous studies and conjectures. A B(1)-branch of a graph is a pendent path of order 2. In this paper, we provide an important step forward to the full characterization of these minimal trees. Namely, we show that a minimal-ABC tree contains neither 4 nor 3 B(1)-branches. The case when the number of B(1)-branches is 2 is also considered.