bounds on sombor index and inverse sum indeg (isi) index of graph operations

Let $ g $ be a graph with vertex set $ v(g) $ and edge set $ e(g) $. denote by $ d_g(u) $ the degree of a vertex $ u in v(g) $. the sombor index of $ g $ is defined as $ so(g) = sum_{uv in e(g)} sqrt{d_u^2 + d_v^2} $, whereas, the inverse sum indeg $ (isi) $ index is defined as $ isi(g) = sum_{uv in e(g)}    frac{d_{u}d_{v}}{d_{u} + d_{v}}. $ in this paper, we compute the bounds in terms of maximum degree, minimum degree, order and size of the original graphs $ g $ and $ h $ for sombor and $ isi $ indices of several graph operations like corona product, cartesian product, strong product, composition and join of graphs.