Let \ (E (G) \) and \ (dₓ\) denote the edge set and degree of a vertex \ (x\) in \ (G\), respectively. Recently, the elliptic Sombor index has been defined as (G) = ₗₘ ₄ (₆) (dₓ + dᵧ) dₓ² + dᵧ²\,. \ A molecular tree is a tree in which the maximum degree does not exceed \ (4\). In this paper, we establish sharp upper and lower bounds for the \ (ESO\) index in the class of molecular trees with order \ (n\) and exactly \ (k\) vertices of maximum degree \ (2\). Moreover, we completely characterize the extremal trees attaining these bounds. Our findings contribute to the structural analysis of molecular trees and further the understanding of the elliptic Sombor index in chemical graph theory.
Ahmad et al. (Sat,) studied this question.