{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:19:50Z","timestamp":1773407990166,"version":"3.50.1"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","funder":[{"name":"Summer Graduate Research Assistantship Program of Graduate School"},{"name":"College of Liberal Arts Summer Research Grant"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:p> Let [Formula: see text] be multiplicative Zagreb index of a graph [Formula: see text]. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which is a generalization of trees and has been the interest of researchers in the field of material chemistry and graph theory. In this paper, we use a new tool to obtain the upper and lower bounds of [Formula: see text] for all cactus graphs and characterize the corresponding extremal graphs. <\/jats:p>","DOI":"10.1142\/s1793830916500403","type":"journal-article","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T09:10:23Z","timestamp":1460020223000},"page":"1650040","source":"Crossref","is-referenced-by-count":13,"title":["Multiplicative Zagreb indices of cacti"],"prefix":"10.1142","volume":"08","author":[{"given":"Shaohui","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Mathematics, The University of Mississippi, University, MS 38677, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Wei","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The University of Mississippi, University, MS 38677, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,8]]},"reference":[{"key":"S1793830916500403BIB001","volume-title":"Introduction to Plastics","author":"Arnold L. K.","year":"1968"},{"key":"S1793830916500403BIB002","first-page":"225","volume":"50","author":"Bollobs B.","year":"1998","journal-title":"Ars Combin."},{"key":"S1793830916500403BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120901"},{"key":"S1793830916500403BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.04.007"},{"key":"S1793830916500403BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9515-6"},{"key":"S1793830916500403BIB006","first-page":"17","volume":"18","author":"Gutman I.","year":"2011","journal-title":"Bull. Soc. Math. Banja Luka"},{"key":"S1793830916500403BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(72)85099-1"},{"key":"S1793830916500403BIB009","first-page":"113","volume":"23","author":"Khadikar P. V.","year":"2000","journal-title":"Nat. Acad. Sci. Lett."},{"key":"S1793830916500403BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0893-9659(96)00071-7"},{"key":"S1793830916500403BIB011","doi-asserted-by":"publisher","DOI":"10.2298\/FIL1206189L"},{"key":"S1793830916500403BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.031"},{"issue":"1","key":"S1793830916500403BIB013","first-page":"183","volume":"58","author":"Liu H. Q.","year":"2007","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830916500403BIB014","first-page":"149","volume":"51","author":"Lu M.","year":"2004","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830916500403BIB015","first-page":"209","volume":"16","author":"Narumi H.","year":"1984","journal-title":"Mem. Fac. Engin. Hokkaido Univ."},{"key":"S1793830916500403BIB016","first-page":"113","volume":"76","author":"Nikoli\u0107 S.","year":"2003","journal-title":"Croat. Chem. Acta"},{"key":"S1793830916500403BIB017","first-page":"149","volume":"96","author":"Wang H.","year":"2015","journal-title":"Util. Math."},{"key":"S1793830916500403BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.08.017"},{"key":"S1793830916500403BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-009-9534-1"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:44:01Z","timestamp":1565113441000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":18,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2016,8]]},"published-print":{"date-parts":[[2016,9]]}},"alternative-id":["10.1142\/S1793830916500403"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500403","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}