Title of article
Some observations on sombor coindex of graphs
Author/Authors
Milovanovic ، E. Faculty of Electronic Engineering - University of Niš , Stankov ، S. Faculty of Electronic Engineering - University of Niš , Matejic ، M. Faculty of Electronic Engineering - University of Niš , Milovanovic ، I. Faculty of Electronic Engineering - University of Niš
From page
813
To page
825
Abstract
Let $G=(V,E)$, $V=\left\{ v_{1},v_{2},\ldots ,v_{n}\right\}$, be a simple graph of order $n$ and size $m$, without isolated vertices. The Sombor coindex of a graph $G$ is defined as $\overline{SO}(G)=\sum_{i\nsim j}\sqrt{d_i^2+d_j^2}$ , where $d_i= d(v_i)$ is a degree of vertex $v_i$, $i=1,2,\ldots , n$. In this paper we investigate a relationship between Sombor coindex and a number of other topological coindices.
Keywords
Topological indices , coindices , Sombor coindex
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2762253
Link To Document