Some Extremal Graphs with Respect to Sombor Index

Das, Kinkar Chandra and Shang, Yilun (2021) Some Extremal Graphs with Respect to Sombor Index. Mathematics, 9 (11). p. 1202. ISSN 2227-7390

mathematics-09-01202.pdf - Published Version
Available under License Creative Commons Attribution 4.0.

Download (263kB) | Preview
Official URL:


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.

Item Type: Article
Uncontrolled Keywords: graph, Sombor index, chromatic number, clique number
Subjects: G100 Mathematics
Department: Faculties > Engineering and Environment > Computer and Information Sciences
Depositing User: Elena Carlaw
Date Deposited: 25 May 2021 15:49
Last Modified: 31 Jul 2021 16:33

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics