The minimum Sombor index of trees with given number of pendant vertices

For any graph G, the Sombor index is defined as SO(G) = Sigma(uv is an element of E(G)) root d(G)(2)(u) + d(G)(2) (v), where d(G)(u) is the degree of the vertex u in G. In this paper, we determine the minimum Sombor index of trees of order n >= 7 with p = >= 3 pendant vertices, which gives the partial solution for the open problem Das et al. (Mathematics 9:#1202, 2021). Our results also extend the results Liu et al. (Int J Quantum Chem 121: #e26689, 2021), about the minimum value of the Sombor index of chemical trees of order n with p pendant vertices.