Some Extremal Graphs with Respect to Sombor Index

Kinkar Chandra Das and Yilun Shang
Additional contact information
Kinkar Chandra Das: Department of Mathematics, Sungkyunkwan University, Suwon 16419, Korea
Yilun Shang: Department of Computer and Information Sciences, Northumbria University, Newcastle NE1 8ST, UK

Mathematics, 2021, vol. 9, issue 11, 1-15

Abstract: Let G be a graph with set of vertices V ( G ) ( | V ( G ) | = n ) and edge set E ( G ) . Very recently, a new degree-based molecular structure descriptor, called Sombor index is denoted by S O ( G ) and is defined as S O = S O ( G ) = ? v i v j ? E ( G ) d G ( v i ) 2 + d G ( v j ) 2 , where d G ( v i ) is the degree of the vertex v i in G . In this paper we present some lower and upper bounds on the Sombor index of graph G in terms of graph parameters (clique number, chromatic number, number of pendant vertices, etc.) and characterize the extremal graphs.

Keywords: graph; Sombor index; chromatic number; clique number (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/11/1202/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/11/1202/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:11:p:1202-:d:562137

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().