{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:54:01Z","timestamp":1760241241908,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T00:00:00Z","timestamp":1576627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["National Key Research and Development Program 2016YFB0200604"],"award-info":[{"award-number":["National Key Research and Development Program 2016YFB0200604"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly discovered, may find wide applications, for example, in design of network topologies.<\/jats:p>","DOI":"10.3390\/sym12010002","type":"journal-article","created":{"date-parts":[[2019,12,23]],"date-time":"2019-12-23T03:23:12Z","timestamp":1577071392000},"page":"2","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Structured Table of Graphs with Symmetries and Other Special Properties"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3041-5082","authenticated-orcid":false,"given":"Yidan","family":"Zhang","sequence":"first","affiliation":[{"name":"Mathematics Department, Stony Brook University, Stony Brook, NY 11794, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1174-7148","authenticated-orcid":false,"given":"Xiaolong","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY 11794, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7460-8981","authenticated-orcid":false,"given":"Zhipeng","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China"},{"name":"Guangdong Province Key Laboratory of Computational Science, Guangzhou 510275, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5224-3958","authenticated-orcid":false,"given":"Yuefan","family":"Deng","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY 11794, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1109\/TC.1968.229158","article-title":"The ILLIAC IV Computer","volume":"C-17","author":"Barnes","year":"1968","journal-title":"IEEE Trans. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01660031","article-title":"The torus routing chip","volume":"1","author":"Dally","year":"1986","journal-title":"Distrib. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/S0026-2714(96)00128-X","article-title":"Reliability analysis of hypercube multicomputers","volume":"37","author":"Tripathy","year":"1997","journal-title":"Microelectron. Reliab."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2912","DOI":"10.1016\/j.tcs.2010.04.022","article-title":"A class of hierarchical graphs as topologies for interconnection networks","volume":"411","author":"Lai","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Guo, D., Chen, T., Li, D., Liu, Y., Liu, X., and Chen, G. (2011, January 10\u201315). BCN: Expansible network structures for data centers using hierarchical compound graphs. Proceedings of the 2011 IEEE INFOCOM, Shanghai, China.","DOI":"10.1109\/INFCOM.2011.5935239"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"056101","DOI":"10.1103\/PhysRevE.65.056101","article-title":"Geometric fractal growth model for scale-free networks","volume":"65","author":"Jung","year":"2002","journal-title":"Phys. Rev. E"},{"key":"ref_8","first-page":"694","article-title":"On a Class of Multistage Interconnection Networks","volume":"29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput. C"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/71.262585","article-title":"The hierarchical hypercube: a new interconnection topology for massively parallel systems","volume":"5","author":"Malluhi","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., and Klavzar, S. (2011). Handbook of Product Graphs (Discrete Mathematics and Its Applications), CRC Press.","DOI":"10.1201\/b10959"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Deng, Y., Guo, M., Ramos, A.F., Huang, X., Xu, Z., and Liu, W. (2019). Optimal Low-Latency Network Topologies for Cluster Performance Enhancement. arXiv.","DOI":"10.1007\/s11227-020-03216-y"},{"key":"ref_12","unstructured":"Xu, Z., and Deng, Y. (2019, January 17\u201322). Optimal Routing for a Family of Scalable Interconnection Networks. Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC\u201919 Poster), Denver, CO, USA."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Xu, Z., Huang, X., Jimenez, F., and Deng, Y. (2019). A New Record of Graph Enumeration Enabled by Parallel Processing. Mathematics, 7.","DOI":"10.3390\/math7121214"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.3390\/sym2031683","article-title":"Complex Networks and Symmetry I: A Review","volume":"2","author":"Garlaschelli","year":"2010","journal-title":"Symmetry"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/sym3010001","article-title":"Symmetry in Complex Networks","volume":"3","author":"Garrido","year":"2011","journal-title":"Symmetry"},{"key":"ref_16","unstructured":"Conder, M. (2019, October 06). Marston Conder Web. Available online: https:\/\/www.math.auckland.ac.nz\/~conder\/."},{"key":"ref_17","first-page":"621","article-title":"Computational Techniques for the Automorphism Groups of Graphs","volume":"34","author":"Balasubramanian","year":"1994","journal-title":"J. Chem. Inf. Model."},{"key":"ref_18","first-page":"197","article-title":"Graph automorphism perception algorithms in computer-enhanced structure elucidation","volume":"33","author":"Razinger","year":"1993","journal-title":"J. Chem. Inf. Model."},{"key":"ref_19","first-page":"158","article-title":"Computational Enumeration of Colorings of Hyperplanes of Hypercubes for all Irreducible Representations and Applications","volume":"1","author":"Balasubramanian","year":"2018","journal-title":"J. Math. Sci. Model."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Bapat, R.B. (2014). Graphs and Matrices, Springer.","DOI":"10.1007\/978-1-4471-6569-9"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J., and Singleton, R.R. (2003). On Moore Graphs with Diameters 2 and 3. Selected Papers of Alan J Hoffman, World Scientific.","DOI":"10.1142\/9789812796936_0038"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230040405","article-title":"A lower bound on the average shortest path length in regular graphs","volume":"4","author":"Cerf","year":"1974","journal-title":"Networks"},{"key":"ref_23","unstructured":"Dally, W., and Towles, B. (2003). Principles and Practices of Interconnection Networks, Morgan Kaufmann Publishers."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3525","DOI":"10.1016\/j.dam.2008.04.008","article-title":"Symmetry in complex networks","volume":"156","author":"MacArthur","year":"2008","journal-title":"Discret. Appl. Math."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Sanders, P., and Schulz, C. (2013). Think locally, act globally: Highly balanced graph partitioning. International Symposium on Experimental Algorithms, Springer.","DOI":"10.1007\/978-3-642-38527-8_16"},{"key":"ref_26","unstructured":"The Sage Developers (2019, October 06). SageMath, The Sage Mathematics Software System (Version 8.8). Available online: https:\/\/www.sagemath.org."},{"key":"ref_27","unstructured":"Tange, O. (2018). GNU Parallel 2018, Lulu.com."},{"key":"ref_28","unstructured":"Dummit, D.S., and Foote, R.M. (2003). Abstract Algebra, John Wiley & Sons."},{"key":"ref_29","unstructured":"The GAP Group (2019, October 06). GAP\u2014Groups, Algorithms, and Programming, Version 4.10.2. Available online: https:\/\/www.gap-system.org."},{"key":"ref_30","unstructured":"Dokchitser, T. (2019, October 06). GroupNames. Available online: https:\/\/people.maths.bris.ac.uk\/~matyd\/GroupNames\/index.html."},{"key":"ref_31","unstructured":"Wolfram Research (2019, October 06). \u201cGraphData\u201d from Wolfram Mathematica. Available online: https:\/\/reference.wolfram.com\/language\/ref\/GraphData.html."},{"key":"ref_32","first-page":"161","article-title":"Crossing number graphs","volume":"11","author":"Pegg","year":"2009","journal-title":"Math. J."},{"key":"ref_33","first-page":"4","article-title":"Dynamic cage survey","volume":"15","author":"Exoo","year":"2008","journal-title":"Electron. J. Combin"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/1\/2\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:43:12Z","timestamp":1760190192000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/1\/2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,18]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["sym12010002"],"URL":"https:\/\/doi.org\/10.3390\/sym12010002","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2019,12,18]]}}}