{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T20:28:15Z","timestamp":1770496095236,"version":"3.49.0"},"reference-count":30,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T00:00:00Z","timestamp":1692057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>The complexity (number of spanning trees) in a finite graph \u0393 (network) is crucial. The quantity of spanning trees is a fundamental indicator for assessing the dependability of a network. The best and most dependable network is the one with the most spanning trees. In graph theory, one constantly strives to create novel structures from existing ones. The super subdivision operation produces more complicated networks, and the matrices of these networks can be divided into block matrices. Using methods from linear algebra and the characteristics of block matrices, we derive explicit formulas for determining the complexity of the super subdivision of a certain family of graphs, including the cycle Cn, where n=3,4,5,6; the dumbbell graph Dbm,n; the dragon graph Pm(Cn); the prism graph \u03a0n, where n=3,4; the cycle Cn with a Pn2-chord, where n=4,6; and the complete graph K4. Additionally, 3D plots that were created using our results serve as illustrations.<\/jats:p>","DOI":"10.3390\/computation11080162","type":"journal-article","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T11:06:16Z","timestamp":1692097576000},"page":"162","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Complexity of the Super Subdivision of Cycle-Related Graphs Using Block Matrices"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1100-3309","authenticated-orcid":false,"given":"Mohamed R.","family":"Zeen El Deen","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Faculty of Science, Suez University, Suez 43111, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4737-1434","authenticated-orcid":false,"given":"Walaa A.","family":"Aboamer","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Faculty of Science, Suez University, Suez 43111, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3624-8748","authenticated-orcid":false,"given":"Hamed M.","family":"El-Sherbiny","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Faculty of Science, Suez University, Suez 43111, Egypt"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., and Murty, U.S.R. (2008). Graph Theory, Springer.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Jota, D.-M., and J\u00e4ntschi, L. (2017). Extending the Characteristic Polynomial for Characterization of C20 Fullerene Congeners. Mathematics, 5.","DOI":"10.3390\/math5040084"},{"key":"ref_3","first-page":"187","article-title":"On the complexity of molecular graphs","volume":"40","year":"1999","journal-title":"Commun. Math. Comput. Chem."},{"key":"ref_4","first-page":"920","article-title":"Complexity of molecules","volume":"40","year":"2000","journal-title":"J. Chem. Int. Commun. Comput. Sci."},{"key":"ref_5","unstructured":"Meyers, R. (2018). Encyclopedia of Complexity and Systems Science, Springer."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Gao, Y., Chen, S., Tong, J., and Fu, X. (2022). Topology-enhanced molecular graph representation for anti-breast cancer drug selection. BMC Bioinform., 23.","DOI":"10.1186\/s12859-022-04913-6"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"6285","DOI":"10.1016\/j.arabjc.2020.05.021","article-title":"On entropy measures of molecular graphs using topological indices","volume":"13","author":"Manzoor","year":"2020","journal-title":"Arab. J. Chem."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Bapat, R.B. (2010). Graphs and Matrices, Springer.","DOI":"10.1007\/978-1-84882-981-7"},{"key":"ref_9","unstructured":"Biggs, N.L. (1993). Algebraic Graph Theory, Cambridge University Press. [2nd ed.]."},{"key":"ref_10","unstructured":"Temperley, H.N.V. (1981). Graph Theory and Applications, John Wiley and Sons, Inc.. Ellis Horwood Series in Mathematics and its Applications."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(96)85158-4","article-title":"Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes","volume":"67","author":"Brownaj","year":"1996","journal-title":"Discret. Appl. Math."},{"key":"ref_12","first-page":"263","article-title":"A theorem for counting spanning trees in general chemical graphs and its particular application to toroidal fullerenes","volume":"77","author":"Kirby","year":"2004","journal-title":"Croat. Chem. Acta"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1140\/epjp\/i2015-15217-y","article-title":"The deletion-contraction method for counting the number of spanning trees of graphs","volume":"130","author":"Daoud","year":"2015","journal-title":"Eur. Phys. J. Plus"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"016116","DOI":"10.1103\/PhysRevE.83.016116","article-title":"Spanning trees in a fractal scale\u2014Free lattice","volume":"83","author":"Zhang","year":"2011","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.laa.2009.08.028","article-title":"Determinant identities for Laplace matrices","volume":"432","author":"Teufl","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"e04786","DOI":"10.1016\/j.heliyon.2020.e04786","article-title":"Complexity trees of the sequence of some nonahedral graphs generated by triangle","volume":"6","author":"Daoud","year":"2020","journal-title":"Heliyon"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"56736","DOI":"10.1109\/ACCESS.2021.3059048","article-title":"Complexity of some duplicating networks","volume":"9","author":"Aboamer","year":"2021","journal-title":"IEEE Access"},{"key":"ref_18","first-page":"4248","article-title":"Complexity of some graphs generated by a square","volume":"11","author":"Aboamer","year":"2021","journal-title":"J. Math. Comput. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.22199\/issn.0717-6279-4664","article-title":"Enumeration of spanning trees in prisms of some graphs","volume":"42","year":"2023","journal-title":"Proyecciones J. Math."},{"key":"ref_20","first-page":"65","article-title":"Counting spanning trees in a prism and anti-prism graphs","volume":"6","author":"Sun","year":"2016","journal-title":"J. Appl. Anal. Comput."},{"key":"ref_21","first-page":"1183","article-title":"The number of spanning trees in some classes of graphs","volume":"42","author":"Bibak","year":"2012","journal-title":"Rocky Mt. J. Math."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Liu, J.-B., and Daoud, S.N. (2018). The complexity of some classes of pyramid graphs created from a gear graph. Symmetry, 10.","DOI":"10.3390\/sym10120689"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"4271783","DOI":"10.1155\/2019\/4271783","article-title":"Number of spanning trees in the sequence of some graphs","volume":"2019","author":"Liu","year":"2019","journal-title":"Complexity"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1140\/epjp\/i2014-14146-7","article-title":"Generating formulas of the number of spanning trees of some special graphs","volume":"129","author":"Daoud","year":"2014","journal-title":"Eur. Phys. J. Plus"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"6288054","DOI":"10.1155\/2022\/6288054","article-title":"Computation of the complexity of networks under generalized operations","volume":"2022","author":"Afzal","year":"2022","journal-title":"Complexity"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.jtusci.2016.04.002","article-title":"The complexity of Some Families of Cycle-Related Graphs","volume":"11","author":"Daoud","year":"2017","journal-title":"J. Taibah Univ. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Zhang, F. (2011). Matrix Theory, Springer.","DOI":"10.1007\/978-1-4614-1099-7"},{"key":"ref_28","unstructured":"Marcus, M. (1964). A Survey of Matrix Theory and Matrix Inequalities, Unvi. Allyn and Bacon, Inc."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Gross, D.J., Saccoman, T.J., and Suffel, L.C. (2014). Spanning Tree Results For Graphs Furthermore, Multigraphs: A Matrix-Theoretic Approach, World Scientific Publishing Company.","DOI":"10.1142\/8963"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Balakrishnan, R., and Ranganathan, K. (2012). A Textbook of Graph Theory, Springer Science and Business Media.","DOI":"10.1007\/978-1-4614-4529-6"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/11\/8\/162\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:34:18Z","timestamp":1760128458000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/11\/8\/162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,15]]},"references-count":30,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["computation11080162"],"URL":"https:\/\/doi.org\/10.3390\/computation11080162","relation":{},"ISSN":["2079-3197"],"issn-type":[{"value":"2079-3197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,15]]}}}