The inverse sum indeg (ISI) index of a simple graph 𝒦 is expressed by  ISI(𝒦) = ∑ς𝒦 ς’𝒦∈E𝒦 d𝒦  (ς𝒦)d𝒦 (ς’𝒦)/d𝒦 (ς𝒦) + d𝒦 (ς’𝒦).   in which E𝒦 represents the edge set of the graph 𝒦 and d𝒦 (ς𝒦) indicates the degree of the vertex ς𝒦 in 𝒦. The ISI index is one of the 20 selected indices from a group of 148 discrete Adriatic indices that have been proposed as remarkable predictors of physico-chemical properties of molecular structures. In addition, this index has been detected as an excellent measure for predicting the total surface area of isomers of octane. In this study, we establish a comparison between the ISI index for various standard graph operations, including the sum, corona product, disjunctive product, Cartesian product, lexicographic product, and strong product, alongside the ISI index of their respective factors. This comparison is achieved by presenting new and sharp upper and lower bounds on the ISI index for the aforementioned graph operations, expressed based on the ISI indices of their respective factors. The necessary and sufficient conditions for the inequalities to hold as equalities are also analyzed. In the specific case where all factors are regular graphs, we provide exact formulas for the ISI index. Utilizing these results, we present precise values for the ISI index of various graphs of mathematical or chemical significance, including cone graphs, windmill graphs, thorn graphs, C4-nanotori, Rook’s graphs, prism graphs, and closed fence graphs.