Sombor index of chemical graphs

A graph G consists of a set of vertices V(G) and a set of edges E(G). Recently, a new vertex-degree-based molecular structure descriptor was introduced, defined as S0(G) - (Sigma uv is an element of E(G)) root(d(u))(2) + (d(v))(2) and named Sombor index. By d(u) is denoted the degree of the vertex u is an element of V(G). In this paper we are concerned with the Sombor index of chemical graphs. Recall that G is a chemical graph if d(u) <= 4 for all u is an element of V(G). We characterize the graphs extremal with respect to the Sombor index over the following sets: (connected) chemical graphs, chemical trees, and hexagonal systems. (C) 2021 Elsevier Inc. All rights reserved.

Automated summary

The paper introduces a new descriptor, the Sombor index, based on molecular structure, and focuses on studying its application in chemical graphs. It characterizes extremal graphs with respect to the Sombor index in chemical graphs, chemical trees, and hexagonal systems.