Sum Connectivity Index Under the Cartesian and Strong Products Graph of Monogenic Semigroup

Abstract

This field’s main feature is to implement the sum connectivity index method. This sum connectivity index method can solve the monogenic semigroups under the cartesian and strong products. We will define for an undirected graph as SCI(GMS)=Σuv∈E(GMS) [dGMS(u)+dGMS(v)]−1/2, where dGMS(u) and dGMS(v) are degree of u and v in GMS respectively. Further, we investigate two different algorithms concerning topological index for computing cartesian and strong products of a monogenic semigroup with a detailed example.