Answers are grounded in this paper and cite their sources.
For a graph G, the Sombor index and the elliptic Sombor index are defined, respectively, as SO(G)=∑xixj∈E(G)dxi2+dxj2,ESO(G)=∑xixj∈E(G)(dxi+dxj)dxi2+dxj2,where E(G) denotes the edge set of G, and dxi is the degree of vertex xi. The main purpose of this study is to investigate extremal n-vertex c-cyclic graphs for c∈{0,1}, concerning the Sombor and elliptic Sombor indices, with particular emphasis on the structural parameter of maximum degree Δ. Notably, in each class of c-cyclic graphs with a given Δ, the same graphs attain the maximum value for both the SO and ESO indices. In contrast, the graphs that give the minimum value differ, showing important structural differences between the two indices. These results also remain valid when restricted to molecular graphs.
No takes yet. Share an insight, caveat, or question.
Faheem et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: