On Sombor Index of Graphs

Abstract

Recently, Gutman defined a new vertex-degree-based graph invariant, named the Sombor index $SO$ of a graph $G$, and is defined by $$SO(G)=\sum _{uv\in E(G)}\sqrt{d_G(u{)}^2+d_G(v{)}^2},$$ where $d_G(v)$ is the degree of the vertex $v$ of $G$. In this paper, we obtain the sharp lower and upper bounds on $SO(G)$ of a connected graph, and characterize graphs for which these bounds are attained.