Das, Kinkar, Çevik, Ahmet, Cangul, Ismail and Shang, Yilun (2021) On Sombor Index. Symmetry, 13 (1). p. 140. ISSN 2073-8994
|
Text
symmetry-13-00140.pdf - Published Version Available under License Creative Commons Attribution 4.0. Download (259kB) | Preview |
Official URL: https://doi.org/10.3390/sym13010140
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)=∑vivj∈E(G)dG(vi)2+dG(vj)2√, where dG(vi) 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.
| Item Type: | Article |
|---|---|
| Additional Information: | Funding Information: Funding: This research was funded by Northumbria University under No. 201920A1001. |
| Uncontrolled Keywords: | independence number, minimum degree, maximum degree, sombor index, graph |
| Subjects: | G900 Others in Mathematical and Computing Sciences |
| Department: | Faculties > Engineering and Environment > Computer and Information Sciences |
| Depositing User: | Rachel Branson |
| Date Deposited: | 18 Jan 2021 12:18 |
| Last Modified: | 31 Jul 2021 15:05 |
| URI: | http://nrl.northumbria.ac.uk/id/eprint/45243 |
Actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
