@article {
author = {Espinal, Carlos and Gutman, Ivan and Rada, Juan},
title = {Elliptic Sombor index of chemical graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {},
number = {},
pages = {-},
year = {2024},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2024.29404.1977},
abstract = {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.},
keywords = {Elliptic Sombor index,Chemical graph,Vertex-degree-based topological index},
url = {https://comb-opt.azaruniv.ac.ir/article_14751.html},
eprint = {https://comb-opt.azaruniv.ac.ir/article_14751_33749bb5fb26201daa58c23438dc54b9.pdf}
}