{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:59:05Z","timestamp":1773388745881,"version":"3.50.1"},"reference-count":54,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"vor","delay-in-days":39,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Key Teaching Research Project of Quality Engineering in Colleges and Universities in Anhui Province","award":["2017jyxm0907"],"award-info":[{"award-number":["2017jyxm0907"]}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Sierpinski networks are networks of fractal nature having several applications in computer science, music, chemistry, and mathematics. These networks are commonly used in chaos, fractals, recursive sequences, and complex systems. In this article, we compute various connectivity polynomials such as <jats:italic>M<\/jats:italic>\u2010polynomial, Zagreb polynomials, and forgotten polynomial of generalized Sierpinski networks  and recover some well\u2010known degree\u2010based topological indices from these. We also compute the most general Zagreb index known as (<jats:italic>\u03b1<\/jats:italic>, <jats:italic>\u03b2<\/jats:italic>)\u2010Zagreb index and several other general indices of similar nature for this network. Our results are the natural generalizations of already available results for particular classes of such type of networks.<\/jats:p>","DOI":"10.1155\/2021\/6657298","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T03:16:47Z","timestamp":1612927007000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Polynomials and General Degree\u2010Based Topological Indices of Generalized Sierpinski Networks"],"prefix":"10.1155","volume":"2021","author":[{"given":"Chengmei","family":"Fan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6719-7376","authenticated-orcid":false,"given":"M. Mobeen","family":"Munir","sequence":"additional","affiliation":[]},{"given":"Zafar","family":"Hussain","sequence":"additional","affiliation":[]},{"given":"Muhammad","family":"Athar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9620-7692","authenticated-orcid":false,"given":"Jia-Bao","family":"Liu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2797483"},{"key":"e_1_2_9_2_2","first-page":"93","article-title":"M-polynomial and degree-based topological indices. Iran","volume":"6","author":"Deutsch E.","year":"2015","journal-title":"Journal of Mathematical Chemistry"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-015-0431-9"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.5562\/cca2294"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.2298\/jsc121002134g"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.015"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.14317\/jami.2015.365"},{"key":"e_1_2_9_8_2","first-page":"233","article-title":"Further properties of zagreb indices","volume":"54","author":"Zhou B.","year":"2005","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/qua.21223"},{"key":"e_1_2_9_10_2","first-page":"1","article-title":"M-polynomials and topological indices of titania nanotubes","volume":"8","author":"Munir M.","year":"2017","journal-title":"Syemmetry"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym9010006"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.3390\/sym9010017"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.12988\/ijma.2017.7118"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1515\/chem-2018-0010"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1515\/phys-2018-0054"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-08309-y"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1021\/ja00856a001"},{"key":"e_1_2_9_18_2","volume-title":"Recent Results in the Theory of Randic Index","author":"Gutman I.","year":"2008"},{"key":"e_1_2_9_19_2","volume-title":"Mathematical Aspects of Randic-type Descriptors","author":"Li X.","year":"2006"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1002\/9783527613106"},{"key":"e_1_2_9_21_2","first-page":"819","article-title":"The vertex-connectivity index revisited","volume":"38","author":"Amic D.","year":"1998","journal-title":"Journal of Chemical Information and Modeling"},{"key":"e_1_2_9_22_2","first-page":"225","article-title":"Graphs of extremal weights","volume":"50","author":"Bollobas B.","year":"1998","journal-title":"Ars Combinatoria"},{"key":"e_1_2_9_23_2","volume-title":"Mathematical Chemistry Monographs","author":"Li X.","year":"2006"},{"key":"e_1_2_9_24_2","first-page":"425","article-title":"On molecular graphs with smallest and greatest zeroth-Corder general randic index","volume":"54","author":"Huang Y.","year":"2005","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(72)85099-1"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10910-010-9677-3"},{"key":"e_1_2_9_27_2","first-page":"483","article-title":"Augmented zagreb index of connected graphs","volume":"67","author":"Huang Y.","year":"2012","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"e_1_2_9_28_2","first-page":"163","article-title":"Similarity of molecular descriptors the equivalence of zagreb indices and walk counts","volume":"54","author":"Braun J.","year":"2005","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"e_1_2_9_29_2","first-page":"187","article-title":"On conjectures of graffiti-II","volume":"60","author":"Fajtlowicz S.","year":"1987","journal-title":"Congr. Numer"},{"key":"e_1_2_9_30_2","first-page":"83","article-title":"The first zagreb index 30 Years after","volume":"50","author":"Gutman I.","year":"2004","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"e_1_2_9_31_2","first-page":"113","article-title":"The zagreb indices 30 Years after","volume":"76","author":"Nikolic S.","year":"2003","journal-title":"Croatica Chemica Acta"},{"key":"e_1_2_9_32_2","first-page":"127","article-title":"A survey on the Randic index","volume":"59","author":"Li X.","year":"2008","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"e_1_2_9_33_2","first-page":"591","article-title":"Remarks on zagreb indices","volume":"57","author":"Zhou B.","year":"2007","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"e_1_2_9_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-70982-1"},{"key":"e_1_2_9_35_2","first-page":"59","article-title":"Generalized Zagreb index of graphs","volume":"56","author":"Azari M.","year":"2011","journal-title":"Studia Universitatis Babes-Bolyai Mathematica"},{"key":"e_1_2_9_36_2","doi-asserted-by":"publisher","DOI":"10.1080\/16583655.2018.1535881"},{"key":"e_1_2_9_37_2","first-page":"241","article-title":"Generalized Zagreb index of V-phenylenic nanotubes and nanotori","volume":"7","author":"Farahani M. R.","year":"2015","journal-title":"Journal of Chemical and Pharmaceutical Research"},{"key":"e_1_2_9_38_2","first-page":"99","article-title":"The generalized Zagreb index of circumcoronene series of benzenoid","volume":"3","author":"Farahani M. R.","year":"2015","journal-title":"Journal of Applied Physical Science International"},{"key":"e_1_2_9_39_2","first-page":"116","article-title":"Relation between phenylene and hexagonal squeeze using harmonic index","volume":"1","author":"Ranjini P. S.","year":"2013","journal-title":"International Journal of Graph Theory and Its Applications"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.21042\/amns.2017.1.00003"},{"key":"e_1_2_9_41_2","doi-asserted-by":"publisher","DOI":"10.21042\/amns.2016.1.00024"},{"key":"e_1_2_9_42_2","doi-asserted-by":"publisher","DOI":"10.12988\/ijma.2017.7454"},{"key":"e_1_2_9_43_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022444205860"},{"key":"e_1_2_9_44_2","first-page":"369","article-title":"1-Perfect codes in sierpinski graphs, bull. Austral","volume":"66","author":"Klavzar S.","year":"2002","journal-title":"Mathematics Society"},{"key":"e_1_2_9_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2017.03.036"},{"key":"e_1_2_9_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2016.10.020"},{"key":"e_1_2_9_47_2","first-page":"1","volume-title":"Computing Molecular Topological Descriptors of Polymeric Networks Modeled by Sierpinski Networks","author":"Iqbal M. A.","year":"2020"},{"key":"e_1_2_9_48_2","doi-asserted-by":"publisher","DOI":"10.2298\/aadm170206009k"},{"key":"e_1_2_9_49_2","doi-asserted-by":"publisher","DOI":"10.3390\/e20090714"},{"key":"e_1_2_9_50_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-07-04363-2"},{"key":"e_1_2_9_51_2","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.813.903"},{"key":"e_1_2_9_52_2","first-page":"58","article-title":"Total coloring of generalized Sierpinski graphs","volume":"63","author":"Geetha J.","year":"2015","journal-title":"The Australasian Journal of Combinatorics"},{"key":"e_1_2_9_53_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.049"},{"key":"e_1_2_9_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.024"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6657298.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6657298.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6657298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:21:42Z","timestamp":1723242102000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6657298"}},"subtitle":[],"editor":[{"given":"M. Irfan","family":"Uddin","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6657298"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6657298","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-11-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-16","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6657298"}}