On the general sum-connectivity index of trees with given number of pendent vertices

The general sum-connectivity index of a graph G is defined as χα(G)=∑uv∈E(G)(d(u)+d(v))α, where d(u) denotes the degree of a vertex u in G and α is a real number. In this paper, we present the maximum general sum-connectivity indices of trees and chemical trees with given number of pendent vertices for −1≤α<0. The corresponding extremal graphs are also characterized.