Nacaroglu, YasarMaden, A. Dilek2020-03-262020-03-2620171846-579Xhttps://dx.doi.org/10.7153/jmi-2017-11-59https://hdl.handle.net/20.500.12395/35617Let G be a simple graph with vertex set V(G) and edge set E(G). In [7], Eliasi et al. introduced the multiplicative sum Zagreb index of a graph G which is denoted by Pi(*)(1) (G) and is defined by Pi(*)(1)(G) = Pi(uv epsilon V(G)) (d(G)(u) + d(G)(v)) In this paper, we present some upper bounds for the multiplicative sum Zagreb indices of the join, rooted product, corona product, tensor product, Cartesian product, strong product, hierarchical product, lexicographic product of graphs.en10.7153/jmi-2017-11-59info:eu-repo/semantics/openAccessZagreb indicesmultiplicative sum Zagreb indexjoinrooted productcorona producttensor productcartesian productstrong producthierarchical productlexicographic productArticle113749761Q2WOS:000411883200011Q2