Bounds on Sombor index of graph operations

Operations in graph theory have a significant influence in the theoretical and application aspect of the domain. Topological indices serve as a crucial component in chemical graph theory linked with some molecular structure. Recently, Gutman initiated the study on the Sombor index. In this paper, the computation of some bounds for Sombor index of graph operation notably join, cartesian product, corona product, lexicographic product, tensor product and strong product is carried out. The computation has been utilized to determine the upper bounds of the index for the specified graph operations for some standard graphs like the path and cycle graphs.