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) = ∑ √d G (v i) 2 + d G (v j) 2, where d G (v i) is the degree of vertex v i in G. Here, v i v j ∈E(G) 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.
Original language | English |
---|---|
Article number | 140 |
Pages (from-to) | 1-12 |
Number of pages | 12 |
Journal | Symmetry |
Volume | 13 |
Issue number | 1 |
DOIs | |
Publication status | Published - 16 Jan 2021 |
Keywords
- Graph
- Independence number
- Maximum degree
- Minimum degree
- Sombor index