On sombor index

Kinkar Chandra Das; Ahmet Sinan Çevik; Ismail Naci Cangul; Yilun Shang

doi:10.3390/sym13010140

On sombor index

Kinkar Chandra Das, Ahmet Sinan Çevik, Ismail Naci Cangul, Yilun Shang

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

170 Scopus citations

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)² + d_G (v_j)², 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	https://doi.org/10.3390/sym13010140
State	Published - Jan 2021

Keywords

Graph
Independence number
Maximum degree
Minimum degree
Sombor index

Access to Document

10.3390/sym13010140

Cite this

@article{9c08f15f19054990aa8b92d8644a7f7b,

title = "On sombor index",

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) = ∑ √dG (vi)2 + dG (vj)2, where dG (vi) is the degree of vertex vi in G. Here, vi vj ∈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.",

keywords = "Graph, Independence number, Maximum degree, Minimum degree, Sombor index",

author = "Das, \{Kinkar Chandra\} and {\c C}evik, \{Ahmet Sinan\} and Cangul, \{Ismail Naci\} and Yilun Shang",

note = "Publisher Copyright: {\textcopyright} 2021 by the authors. Licensee MDPI, Basel, Switzerland.",

year = "2021",

month = jan,

doi = "10.3390/sym13010140",

language = "English",

volume = "13",

pages = "1--12",

journal = "Symmetry",

issn = "2073-8994",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "1",

}

TY - JOUR

T1 - On sombor index

AU - Das, Kinkar Chandra

AU - Çevik, Ahmet Sinan

AU - Cangul, Ismail Naci

AU - Shang, Yilun

PY - 2021/1

Y1 - 2021/1

N2 - 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) = ∑ √dG (vi)2 + dG (vj)2, where dG (vi) is the degree of vertex vi in G. Here, vi vj ∈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.

AB - 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) = ∑ √dG (vi)2 + dG (vj)2, where dG (vi) is the degree of vertex vi in G. Here, vi vj ∈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.

KW - Graph

KW - Independence number

KW - Maximum degree

KW - Minimum degree

KW - Sombor index

UR - https://www.scopus.com/pages/publications/85099798438

U2 - 10.3390/sym13010140

DO - 10.3390/sym13010140

M3 - Article

AN - SCOPUS:85099798438

SN - 2073-8994

VL - 13

SP - 1

EP - 12

JO - Symmetry

JF - Symmetry

IS - 1

M1 - 140

ER -

On sombor index

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this