The newly introduced elliptic Sombor index of a graph G is defined as follows ESO (G) = ∑uvϵE (d (u) + d (v) ) √d (u) 2 + d (v) 2ESO (G) =∑uvϵE (d (u) +d (v) ) d (u) 2+d (v) 2, ESO (G) = ₔ ₕ ₄ (d (u) + d (v) ) d (u) ² + d (v) ², in which E and d (u) are the edge set of G and the degree of the vertex u in G, respectively. In this paper, we compute the elliptic Sombor index for certain graphs. Furthermore, we obtain new results and bounds for the elliptic Sombor index in a graph.
Fateme Movahedi (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: