Sum connectivity jump index of a special graphs obtained by monogenic semigroups

This study aims to calculate the sum connectivity jump index using graphs from monogenic semigroups. Furthermore, the effective algorithm is developed to obtain the vertex degree of the sum connectivity jump index of un-directed graphs through the Pseudo-code. A theorem is created to figure out the sum connectivity jump index for graphs with both odd and even vertices. Additionally, a numerical examples are provided and solved to prove the proposed work.