{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T22:40:02Z","timestamp":1751064002554,"version":"3.41.0"},"reference-count":0,"publisher":"Combinatorial Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ars Comb."],"published-print":{"date-parts":[[2025,6,28]]},"abstract":"<jats:p>&lt;p&gt;Let &lt;span class=\"math inline\"&gt;\\(G = (V(G), E(G))\\)&lt;\/span&gt; be a simple connected graph. The inverse sum indeg index of &lt;span class=\"math inline\"&gt;\\(G\\)&lt;\/span&gt;, denoted by &lt;span class=\"math inline\"&gt;\\(\\text{ISI}(G)\\)&lt;\/span&gt;, is defined as the sum of the weights &lt;span class=\"math inline\"&gt;\\(\\frac{d(u)d(v)}{d(u) + d(v)}\\)&lt;\/span&gt; of all edges &lt;span class=\"math inline\"&gt;\\(uv\\)&lt;\/span&gt; of &lt;span class=\"math inline\"&gt;\\(G\\)&lt;\/span&gt;, where &lt;span class=\"math inline\"&gt;\\(d(u)\\)&lt;\/span&gt; denotes the degree of a vertex in &lt;span class=\"math inline\"&gt;\\(G\\)&lt;\/span&gt;. In this paper, we first present some lower and upper bound for &lt;span class=\"math inline\"&gt;\\(ISI\\)&lt;\/span&gt; index in terms of graph parameters such as maximum degree, minimum degree and clique number. Moreover, we compute &lt;span class=\"math inline\"&gt;\\(ISI\\)&lt;\/span&gt; index of several graph operations like join, cartesian product, composition, corona and strong product of graphs.&lt;\/p&gt;<\/jats:p>","DOI":"10.61091\/ars163-04","type":"journal-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T22:01:43Z","timestamp":1751061703000},"page":"51-67","source":"Crossref","is-referenced-by-count":0,"title":["Bounds on inverse sum indeg index of graph operations"],"prefix":"10.61091","volume":"163","author":[{"name":"College of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P. R. China","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanyuan","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Selvaraj","family":"Balachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"name":"Department of Mathematics, School of Arts, Sciences, Humanities and Education, SASTRA Deemed University, Thanjavur, India","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Elumalai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"name":"Department of Mathematics, College of Engineering and Technology, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Chengalpet 603 203, India","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.G.","family":"Venkatesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"name":"Department of Mathematics, School of Arts, Sciences, Humanities and Education, SASTRA Deemed University, Thanjavur, India","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"39747","published-online":{"date-parts":[[2025,6,28]]},"container-title":["Ars Combinatoria"],"original-title":[],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T22:01:45Z","timestamp":1751061705000},"score":1,"resource":{"primary":{"URL":"https:\/\/combinatorialpress.com\/ars-articles\/volume-163\/bounds-on-inverse-sum-indeg-index-of-graph-operations\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,28]]},"references-count":0,"URL":"https:\/\/doi.org\/10.61091\/ars163-04","relation":{},"ISSN":["0381-7032","2817-5204"],"issn-type":[{"value":"0381-7032","type":"print"},{"value":"2817-5204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,28]]}}}