Sharp Upper Bounds on Forgotten and Sk Indices of Cactus Graph

Abstract

Sheehalli and Kanabur presented new forms of topological indices known as SK indices which have many applications in chemical graph theory towards QSPR/QSAR. A simple connected graph Gamma is called a cactus graph if and only if any two cycles in the graph have no common edge. In this paper, we will explore and determine the sharp upper bounds of cactus graph using different versions of SK indices. We will also characterize the extremal properties for these indices due to many applications in pharmacology and medicinal chemistry.