Some Extremal Graphs with Respect to Sombor Index

Kinkar Chandra Das*, Yilun Shang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

35 Citations (Scopus)
91 Downloads (Pure)


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 SO(G) and is defined as SO=SO(G)=∑vivj∈E(G)dG(vi)2+dG(vj)2, where dG(vi) is the degree of the vertex vi 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.
Original languageEnglish
Article number1202
Pages (from-to)1-15
Number of pages15
Issue number11
Publication statusPublished - 25 May 2021


Dive into the research topics of 'Some Extremal Graphs with Respect to Sombor Index'. Together they form a unique fingerprint.

Cite this