Azarbaijan Shahid Madani University Communications in Combinatorics and Optimization 2538-2128 9 4 2024 12 01 Bounds on sombor index and inverse sum indeg (ISI) index of graph operations 785 798 14609 10.22049/cco.2023.28718.1684 EN Fareeha Jamal Department of Mathematical Sciences, College of Science, United Arab Emirate University, Al Ain 15551, Abu Dhabi, UAE Muhammad Imran Department of Mathematical Sciences, College of Science, United Arab Emirate University, Al Ain 15551, Abu Dhabi, UAE Journal Article 2023 06 04 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. https://comb-opt.azaruniv.ac.ir/article_14609_07c6a6da023d4f2fd3fed522a9b06c76.pdf