On Sombor Index
No Thumbnail Available
Date
2021-02
Journal Title
Journal ISSN
Volume Title
Publisher
MDPI
Abstract
The concept of Sombor index (SO) was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological index and is denoted by Sombor index SO: SO=SO(G)= Sigma(vivj is an element of E(G)) root d(G)(v(i))(2)+d(G)(v(j))(2), where d(G)(v(i)) is the degree of vertex vi in G. Here, we present novel lower and upper bounds on the Sombor index of graphs by using some graph parameters. Moreover, we obtain several relations on Sombor index with the first and second Zagreb indices of graphs. Finally, we give some conclusions and propose future work.
Description
Keywords
Graph, Sombor index, Maximum degree, Minimum degree, Independence number
Citation
Cangül, I. N. vd. (2021)."On sombor index". Symmetry, 13(1), 1-12.