On Sombor Index
The concept of Sombor index <inline-formula><math display="inline"><semantics><mrow><mo>(</mo><mi>S</mi><mi>O</mi><mo>)</mo></mrow></semantics></math></inline-formula> was recently introduced by...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-01-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/13/1/140 |
id |
doaj-7529ad60f95d46b4bd44de27d82ce211 |
---|---|
record_format |
Article |
spelling |
doaj-7529ad60f95d46b4bd44de27d82ce2112021-01-17T00:00:28ZengMDPI AGSymmetry2073-89942021-01-011314014010.3390/sym13010140On Sombor IndexKinkar Chandra Das0Ahmet Sinan Çevik1Ismail Naci Cangul2Yilun Shang3Department of Mathematics, Sungkyunkwan University, Suwon 16419, KoreaDepartment of Mathematics, Faculty of Science, Selçuk University, Campus, 42075 Konya, TurkeyDepartment of Mathematics, Faculty of Art and Science, Bursa Uludag University, Gorukle, 16059 Bursa, TurkeyDepartment of Computer and Information Sciences, Northumbria University, Newcastle NE1 8ST, UKThe concept of Sombor index <inline-formula><math display="inline"><semantics><mrow><mo>(</mo><mi>S</mi><mi>O</mi><mo>)</mo></mrow></semantics></math></inline-formula> was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological index and is denoted by Sombor index <inline-formula><math display="inline"><semantics><mrow><mi>S</mi><mi>O</mi></mrow></semantics></math></inline-formula>: <inline-formula><math display="inline"><semantics><mrow><mi>S</mi><mi>O</mi><mo>=</mo><mi>S</mi><mi>O</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><munder><mo>∑</mo><mrow><msub><mi>v</mi><mi>i</mi></msub><msub><mi>v</mi><mi>j</mi></msub><mo>∈</mo><mi>E</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></munder><mspace width="0.166667em"></mspace><msqrt><mrow><msub><mi>d</mi><mi>G</mi></msub><msup><mrow><mo>(</mo><msub><mi>v</mi><mi>i</mi></msub><mo>)</mo></mrow><mn>2</mn></msup><mo>+</mo><msub><mi>d</mi><mi>G</mi></msub><msup><mrow><mo>(</mo><msub><mi>v</mi><mi>j</mi></msub><mo>)</mo></mrow><mn>2</mn></msup></mrow></msqrt><mo>,</mo></mrow></semantics></math></inline-formula> where <inline-formula><math display="inline"><semantics><mrow><msub><mi>d</mi><mi>G</mi></msub><mrow><mo>(</mo><msub><mi>v</mi><mi>i</mi></msub><mo>)</mo></mrow></mrow></semantics></math></inline-formula> is the degree of vertex <inline-formula><math display="inline"><semantics><msub><mi>v</mi><mi>i</mi></msub></semantics></math></inline-formula> in <i>G</i>. 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.https://www.mdpi.com/2073-8994/13/1/140graphsombor indexmaximum degreeminimum degreeindependence number |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Kinkar Chandra Das Ahmet Sinan Çevik Ismail Naci Cangul Yilun Shang |
spellingShingle |
Kinkar Chandra Das Ahmet Sinan Çevik Ismail Naci Cangul Yilun Shang On Sombor Index Symmetry graph sombor index maximum degree minimum degree independence number |
author_facet |
Kinkar Chandra Das Ahmet Sinan Çevik Ismail Naci Cangul Yilun Shang |
author_sort |
Kinkar Chandra Das |
title |
On Sombor Index |
title_short |
On Sombor Index |
title_full |
On Sombor Index |
title_fullStr |
On Sombor Index |
title_full_unstemmed |
On Sombor Index |
title_sort |
on sombor index |
publisher |
MDPI AG |
series |
Symmetry |
issn |
2073-8994 |
publishDate |
2021-01-01 |
description |
The concept of Sombor index <inline-formula><math display="inline"><semantics><mrow><mo>(</mo><mi>S</mi><mi>O</mi><mo>)</mo></mrow></semantics></math></inline-formula> was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological index and is denoted by Sombor index <inline-formula><math display="inline"><semantics><mrow><mi>S</mi><mi>O</mi></mrow></semantics></math></inline-formula>: <inline-formula><math display="inline"><semantics><mrow><mi>S</mi><mi>O</mi><mo>=</mo><mi>S</mi><mi>O</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><munder><mo>∑</mo><mrow><msub><mi>v</mi><mi>i</mi></msub><msub><mi>v</mi><mi>j</mi></msub><mo>∈</mo><mi>E</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></munder><mspace width="0.166667em"></mspace><msqrt><mrow><msub><mi>d</mi><mi>G</mi></msub><msup><mrow><mo>(</mo><msub><mi>v</mi><mi>i</mi></msub><mo>)</mo></mrow><mn>2</mn></msup><mo>+</mo><msub><mi>d</mi><mi>G</mi></msub><msup><mrow><mo>(</mo><msub><mi>v</mi><mi>j</mi></msub><mo>)</mo></mrow><mn>2</mn></msup></mrow></msqrt><mo>,</mo></mrow></semantics></math></inline-formula> where <inline-formula><math display="inline"><semantics><mrow><msub><mi>d</mi><mi>G</mi></msub><mrow><mo>(</mo><msub><mi>v</mi><mi>i</mi></msub><mo>)</mo></mrow></mrow></semantics></math></inline-formula> is the degree of vertex <inline-formula><math display="inline"><semantics><msub><mi>v</mi><mi>i</mi></msub></semantics></math></inline-formula> in <i>G</i>. 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. |
topic |
graph sombor index maximum degree minimum degree independence number |
url |
https://www.mdpi.com/2073-8994/13/1/140 |
work_keys_str_mv |
AT kinkarchandradas onsomborindex AT ahmetsinancevik onsomborindex AT ismailnacicangul onsomborindex AT yilunshang onsomborindex |
_version_ |
1724335727847669760 |