{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T15:23:27Z","timestamp":1769181807986,"version":"3.49.0"},"reference-count":24,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T00:00:00Z","timestamp":1662595200000},"content-version":"vor","delay-in-days":250,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p>\n                    The connected and acyclic components contained in a network are identified by the computation of its complexity, where complexity of a network refers to the total number of spanning trees present within. The article in hand deals with the enumeration of the complexity of various networks\u2019 operations such as sum (\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>\n                      2,\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    +\n                    <jats:italic>W<\/jats:italic>\n                    <jats:sub>3<\/jats:sub>\n                    ,\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>\n                      2,\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    +\n                    <jats:italic>n<\/jats:italic>\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>1<\/jats:sub>\n                    ,\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    +\n                    <jats:italic>S<\/jats:italic>\n                    <jats:sub>\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    ), product (\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>\n                      2,\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    \u22a0\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>2<\/jats:sub>\n                    ,\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>\n                      2,\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    \u2009\u2009\u22c9\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>2<\/jats:sub>\n                    ,\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    \u00d7\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>2<\/jats:sub>\n                    ,\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    \u22a0\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>2<\/jats:sub>\n                    ), difference (\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>\n                      2,\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    \u2296\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>2<\/jats:sub>\n                    ), and the conjunction of\n                    <jats:italic>S<\/jats:italic>\n                    <jats:sub>\n                      <jats:italic>n<\/jats:italic>\n                    <\/jats:sub>\n                    with\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>2<\/jats:sub>\n                    . All our computations have been concluded by implementation of the methods of linear algebra and matrix theory. Our derivations will also be highlighted with the assistance of 3D plots at the end of this article.\n                  <\/jats:p>","DOI":"10.1155\/2022\/6288054","type":"journal-article","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T21:05:06Z","timestamp":1662671106000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computation of the Complexity of Networks under Generalized Operations"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0817-8260","authenticated-orcid":false,"given":"Hafiz Usman","family":"Afzal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7241-8172","authenticated-orcid":false,"given":"Muhammad","family":"Javaid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4909-3418","authenticated-orcid":false,"given":"Ali","family":"Ovais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6815-678X","authenticated-orcid":false,"given":"Md","family":"Nur Alam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2022,9,8]]},"reference":[{"key":"e_1_2_8_1_2","volume-title":"Algebraic Graph Theory","author":"Biggs N. L.","year":"1993"},{"key":"e_1_2_8_2_2","volume-title":"Spectra of Graphs","author":"Cvetkovic D.","year":"1978"},{"key":"e_1_2_8_3_2","first-page":"356","volume-title":"Proc. On Combinatorial Mathematics","author":"Temperley H. N. V.","year":"1972"},{"key":"e_1_2_8_4_2","volume-title":"Graph Theory and Applications Ellis Horwood Series in Mathematics and its Applications","author":"Temperley H. N. V.","year":"1981"},{"key":"e_1_2_8_5_2","doi-asserted-by":"crossref","first-page":"584","DOI":"10.3844\/ajassp.2012.584.592","article-title":"Some applications of number of spanning trees of complete and complete bipartite graphs","volume":"9","author":"Daoud S. N.","year":"2012","journal-title":"Am. J. Appl. Sci. Sci. Publ."},{"key":"e_1_2_8_6_2","volume-title":"Chebyshev Polynomials","author":"Mason J. C.","year":"2003"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/673270"},{"key":"e_1_2_8_8_2","doi-asserted-by":"crossref","DOI":"10.1142\/8963","volume-title":"Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach","author":"Gross D. J.","year":"2014"},{"key":"e_1_2_8_9_2","volume-title":"Random Circulant Matrices","author":"Bose A.","year":"2019"},{"key":"e_1_2_8_10_2","volume-title":"A Servy of Matrix Theory and Matrix Inequalities","author":"Marcus M.","year":"1964"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3059048"},{"key":"e_1_2_8_12_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8505-7","volume-title":"A Textbook of Graph Theory","author":"Balakrishnan R.","year":"2000"},{"key":"e_1_2_8_13_2","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2003"},{"key":"e_1_2_8_14_2","first-page":"276","article-title":"A theorm on trees","volume":"23","author":"Cayley G. A.","year":"1889","journal-title":"The Quarterly Journal of Mathematics"},{"key":"e_1_2_8_15_2","first-page":"387","volume-title":"Combinatorial Structures and Their Applications","author":"Sedlacek J.","year":"1970"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/andp.18471481202"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjp\/i2015-15217-y"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.3390\/s110706533"},{"key":"e_1_2_8_19_2","volume-title":"Wireless Algorithms, Systems, and Applications, WASA, Lecture Notes in Computer Science","author":"Wang X.","year":"2008"},{"key":"e_1_2_8_20_2","doi-asserted-by":"crossref","first-page":"118310","DOI":"10.1109\/ACCESS.2019.2936454","article-title":"A pedestrian detection method based on genetic algorithm for optimize XGBoost training parameters","volume":"7","author":"Jiang Y.","year":"2019","journal-title":"IEEE Access"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13673-018-0141-x"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.07.013"},{"key":"e_1_2_8_23_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjp\/i2014-14146-7"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/965105"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/6288054","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/2022\/6288054","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/6288054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:20:31Z","timestamp":1769116831000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2022\/6288054"}},"subtitle":[],"editor":[{"given":"Miaomiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1155\/2022\/6288054"],"URL":"https:\/\/doi.org\/10.1155\/2022\/6288054","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"2022-04-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6288054"}}