{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:00:53Z","timestamp":1753887653400,"version":"3.41.2"},"reference-count":23,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"vor","delay-in-days":193,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The number of spanning trees in a network determines the totality of acyclic and connected components present within. This number is termed as complexity of the network. In this article, we address the closed formulae of the complexity of networks\u2019 operations such as duplication (split, shadow, and vortex networks of <jats:italic>S<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub>), sum (<jats:italic>S<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub> + <jats:italic>W<\/jats:italic><jats:sub>3<\/jats:sub>, <jats:italic>S<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub> + <jats:italic>K<\/jats:italic><jats:sub>2<\/jats:sub>, and (<jats:italic>C<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub>\u2218<jats:italic>K<\/jats:italic><jats:sub>2<\/jats:sub>) + <jats:italic>K<\/jats:italic><jats:sub>1<\/jats:sub>), product (<jats:italic>S<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub>\u22a0<jats:italic>K<\/jats:italic><jats:sub>2<\/jats:sub> and <jats:italic>W<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub>\u2218<jats:italic>K<\/jats:italic><jats:sub>2<\/jats:sub>), semitotal networks (<jats:italic>Q<\/jats:italic>(<jats:italic>S<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub>) and <jats:italic>R<\/jats:italic>(<jats:italic>S<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic><\/jats:sub>)), and edge subdivision of the wheel. All our findings in this article have been obtained by applying the methods from linear algebra, matrix theory, and Chebyshev polynomials. Our results shall also be summarized with the help of individual plots and relative comparison at the end of this article.<\/jats:p>","DOI":"10.1155\/2021\/9999157","type":"journal-article","created":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T21:35:09Z","timestamp":1626212109000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Some Generalized Operations on Networks"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7241-8172","authenticated-orcid":false,"given":"Muhammad","family":"Javaid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hafiz Usman","family":"Afzal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6941-3194","authenticated-orcid":false,"given":"Shaohui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,7,13]]},"reference":[{"volume-title":"Algebraic Graph Theory","year":"1993","author":"Biggs N. L.","key":"e_1_2_7_1_2"},{"volume-title":"Spectra of Graphs","year":"1978","author":"Cvetkovic D.","key":"e_1_2_7_2_2"},{"key":"e_1_2_7_3_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_7_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/andp.18471481202"},{"key":"e_1_2_7_5_2","first-page":"356","volume-title":"Proceedings on Combinatorial Mathematics","author":"Temperley H. N. V.","year":"1972"},{"key":"e_1_2_7_6_2","article-title":"Complexity: Knots, Colourings and Counting","author":"Welsh D. J. A.","year":"1993","journal-title":"London Mathematical Society Lecture Notes Series 186"},{"key":"e_1_2_7_7_2","first-page":"276","article-title":"A theorem on trees","volume":"23","author":"Cayley G. A.","year":"1889","journal-title":"The Quarterly Journal of Mathematics"},{"key":"e_1_2_7_8_2","first-page":"387","volume-title":"Combinatorial Structures and Their Applications","author":"Sedlacek J.","year":"1970"},{"key":"e_1_2_7_9_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjp\/i2015-15217-y"},{"key":"e_1_2_7_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90065-3"},{"key":"e_1_2_7_11_2","first-page":"103","article-title":"Number of spanning trees for shadow of some graphs","volume":"4","author":"Daoud S. N.","year":"2013","journal-title":"International Journal of Mathematical Combinatorics"},{"key":"e_1_2_7_12_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjp\/i2014-14146-7"},{"key":"e_1_2_7_13_2","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/965105"},{"key":"e_1_2_7_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtusci.2016.04.002"},{"key":"e_1_2_7_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2917535"},{"key":"e_1_2_7_16_2","doi-asserted-by":"publisher","DOI":"10.3844\/ajassp.2012.584.592"},{"volume-title":"Chebyshev Polynomials","year":"2003","author":"Mason J. C.","key":"e_1_2_7_17_2"},{"key":"e_1_2_7_18_2","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/673270"},{"key":"e_1_2_7_19_2","doi-asserted-by":"publisher","DOI":"10.1142\/8963"},{"volume-title":"Random Circulant Matrices","year":"2019","author":"Bose A.","key":"e_1_2_7_20_2"},{"volume-title":"A Servy of Matrix Theory and Matrix Inequalities","year":"1964","author":"Marcus M.","key":"e_1_2_7_21_2"},{"key":"e_1_2_7_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8505-7"},{"volume-title":"Introduction to Graph Theory","year":"2003","author":"West D. B.","key":"e_1_2_7_23_2"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/9999157.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/9999157.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/9999157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:33:15Z","timestamp":1723242795000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/9999157"}},"subtitle":[],"editor":[{"given":"M.","family":"De Aguiar","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/9999157"],"URL":"https:\/\/doi.org\/10.1155\/2021\/9999157","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-03-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9999157"}}