Extremal Values of Generalized Somber Index in Chemical Graphs

A graph G consists of a set of vertices V(G) and a set of edges E(G). A new vertex-degree-based molecular structure descriptor was introduced, named “Generalized Somber index”. In this paper we determine the extremal values of generalized Somber index in chemical graphs, chemical trees and hexagonal systems. Especially it has been proved that the Somber index could predict some physicochemical properties and make their chemical applications.