Exponential elliptic Sombor index of molecular trees

Let G be a simple connected graph of order n with the vertex set V (G) and edge set E(G).For a vertex v V (G), denote by dG(v) the degree of v in G.The exponential elliptic Sombor index of G is denoted by e ESO (G) and is defined asIn this paper, the minimum and maximum values of the exponential elliptic Sombor index of molecular trees of order n are obtained.Those molecular trees that achieve the obtained minimum and maximum values are also characterized.