%0 Journal Article
%T Elliptic Sombor index of chemical graphs
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Espinal, Carlos
%A Gutman, Ivan
%A Rada, Juan
%D 2024
%\ 04/22/2024
%V
%N
%P -
%! Elliptic Sombor index of chemical graphs
%K Elliptic Sombor index
%K Chemical graph
%K Vertex-degree-based topological index
%R 10.22049/cco.2024.29404.1977
%X Let $G$ be a simple graph. The elliptic Sombor index of $G$ is defined as$$ ESO(G) = \sum_{uv} \left(d_{u}+ d_{v} \right)\sqrt{d^{2}_{u}+d^{2}_{v}},$$ where $d_{u}$ denotes the degree of the vertex $u$, and the sum runs over the set of edges of $G$. In this paper we solve the extremal value problem of $ESO$ over the set of (connected) chemical graphs and over the set of chemical trees, with equal number of vertices.
%U https://comb-opt.azaruniv.ac.ir/article_14751_33749bb5fb26201daa58c23438dc54b9.pdf