Title of article :
New bounds on Sombor index
Author/Authors :
Gutman ، Ivan Faculty of Science - University of Kragujevac , Gürsoy ، Necla Krcal Tire Kutsan Vocational School - Ege University , Gürsoy ، Arif Ege University , Ülker ، Alper Department of Mathematics, , 04100, A gr - Agri Ibrahim Cecen University
Abstract :
The Sombor index of the graph $G$ is a degree based topological index, defined as $SO = sum_{uv in mathbf E(G)}sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of the vertex $u$, and $mathbf E(G)$ is the edge set of $G$. Bounds on $SO$ are established in terms of graph energy, size of minimum vertex cover, matching number, and induced matching number.
Keywords :
Sombor index , degree (of vertex) , graph
Journal title :
Communications in Combinatorics and Optimization
Journal title :
Communications in Combinatorics and Optimization
