{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:18:21Z","timestamp":1760149101619,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T00:00:00Z","timestamp":1688256000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Suzhou Industrial Park Institute of Services Outsourcing","award":["SISO-ZD202202"],"award-info":[{"award-number":["SISO-ZD202202"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The hypercube Qn is one of the most popular interconnection networks with high symmetry. To reduce the diameter of Qn, many variants of Qn have been proposed, such as the n-dimensional locally twisted cube LTQn. To further optimize the diameter of LTQn, the n-dimensional folded locally twisted cube FLTQn is proposed, which is built based on LTQn by adding 2n\u22121 complementary edges. Connectivity is an important indicator to measure the fault tolerance and reliability of a network. However, the connectivity has an obvious shortcoming, in that it assumes all the adjacent vertices of a vertex will fail at the same time. Super-connectivity is a more refined index to judge the fault tolerance of a network, which ensures that each vertex has at least one neighbor. In this paper, we show that the super-connectivity \u03ba(1)(FLTQn)=2n for any integer n\u22656, which is about twice \u03ba(FLTQn).<\/jats:p>","DOI":"10.3390\/sym15071349","type":"journal-article","created":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T00:34:08Z","timestamp":1688344448000},"page":"1349","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Super-Connectivity of the Folded Locally Twisted Cube"],"prefix":"10.3390","volume":"15","author":[{"given":"Lantao","family":"You","sequence":"first","affiliation":[{"name":"School of Information Engineering, Suzhou Industrial Park Institute of Services Outsourcing, Suzhou 215123, China"},{"name":"Suzhou Industrial Park Human Resources Development Co., Ltd., Suzhou 215028, China"},{"name":"Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou 215006, China"},{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejuan","family":"Han","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Suzhou Industrial Park Institute of Services Outsourcing, Suzhou 215123, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,2]]},"reference":[{"key":"ref_1","unstructured":"West, D.B. (2001). Introduction to Graph Theory, Prentice Hall Publishers."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","article-title":"On computing a conditional edge-connectivity of a graph","volume":"27","author":"Esfahanian","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.ipl.2005.07.005","article-title":"The super connectivity of shuffle-cubes","volume":"96","author":"Xu","year":"2005","journal-title":"Inf. Process. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1016\/j.ins.2006.11.003","article-title":"On reliability of the folded hypercubes","volume":"177","author":"Zhu","year":"2007","journal-title":"Inf. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.ipl.2010.05.013","article-title":"Super connectivity of Kronecker products of graphs","volume":"110","author":"Guo","year":"2010","journal-title":"Inf. Process. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.ipl.2016.03.003","article-title":"Locally exchanged twisted cubes: Connectivity and super connectivity","volume":"116","author":"Chang","year":"2016","journal-title":"Inf. Process. Lett."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ipl.2018.10.013","article-title":"The super connectivity of folded crossed cubes","volume":"142","author":"Cai","year":"2019","journal-title":"Inf. Process. Lett."},{"key":"ref_8","first-page":"1287","article-title":"Super connectivity and diagnosability of crossed cubes","volume":"20","author":"Wang","year":"2019","journal-title":"J. Internet Technol."},{"key":"ref_9","first-page":"216","article-title":"The super connectivity of exchanged folded hypercube","volume":"43","author":"Cai","year":"2020","journal-title":"J. Anhui Norm. Univ. Nat. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2020.06.017","article-title":"Connectivity and super connectivity of the divide-and-swap cube","volume":"842","author":"Ning","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.dam.2021.08.022","article-title":"Super connectivity of folded twisted crossed cubes","volume":"305","author":"Guo","year":"2021","journal-title":"Discret. Appl. Math."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2142009","DOI":"10.1142\/S0219265921420093","article-title":"A note on super connectivity of the bouwer graph","volume":"21","author":"Gu","year":"2021","journal-title":"J. Interconnect. Netw."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"S699","DOI":"10.1051\/ro\/2020004","article-title":"The super-connectivity of odd graphs and of their kronecker double cover","volume":"55","author":"Ekinci","year":"2021","journal-title":"Rairo-Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2767","DOI":"10.1051\/ro\/2022085","article-title":"On the super connectivity of direct product of graphs","volume":"56","author":"Soliemany","year":"2022","journal-title":"Rairo-Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.tcs.2022.05.003","article-title":"Connectivity and super connectivity of the exchanged 3-ary n-cube","volume":"923","author":"Ning","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"106377","DOI":"10.1016\/j.ipl.2023.106377","article-title":"Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes","volume":"182","author":"Zhao","year":"2023","journal-title":"Inf. Process. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/71.159036","article-title":"The crossed cube architecture for parallel computation","volume":"3","author":"Efe","year":"1992","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/0020716042000301752","article-title":"The locally twisted cubes","volume":"82","author":"Yang","year":"2005","journal-title":"Int. J. Comput. Math."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/j.ipl.2011.03.011","article-title":"The spined cube: A new hypercube variant with smaller diameter","volume":"111","author":"Zhou","year":"2011","journal-title":"Inf. Process. Lett."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1080\/00207160.2012.742190","article-title":"Changing the diameter of the locally twisted cube","volume":"90","author":"Han","year":"2013","journal-title":"Int. J. Comput. Math."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.jpdc.2016.11.005","article-title":"Fault-tolerant embedding of complete binary trees in locally twisted cubes","volume":"101","author":"Liu","year":"2017","journal-title":"J. Parallel. Distrib. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"102113","DOI":"10.1109\/ACCESS.2019.2931574","article-title":"The h-extra connectivity and diagnosability of locally twisted cubes","volume":"7","author":"Wang","year":"2019","journal-title":"IEEE Access"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1142\/S0129054120500057","article-title":"Communication performance evaluation of the locally twisted cube","volume":"31","author":"Han","year":"2020","journal-title":"Int. J. Found. Comput. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2087","DOI":"10.1007\/s40840-019-00792-y","article-title":"Characterizations of optimal component cuts of locally twisted cubes","volume":"43","author":"Shang","year":"2020","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.dam.2020.09.009","article-title":"Symmetric property and reliability of locally twisted cubes","volume":"288","author":"Chang","year":"2021","journal-title":"Discret. Appl. Math."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/71.80187","article-title":"Properties and performance of folded hyper-cubes","volume":"2","author":"Latifi","year":"1991","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_27","first-page":"7667","article-title":"Topological properties of folded locally twisted cubes","volume":"11","author":"Peng","year":"2015","journal-title":"J. Comput. Inf. Syst."},{"key":"ref_28","first-page":"401","article-title":"Fault tolerance of locally twisted cubes","volume":"334","author":"Guo","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1093\/comjnl\/bxs123","article-title":"Constructive Algorithm of Independent Spanning Trees on Mobius Cubes","volume":"56","author":"Cheng","year":"2013","journal-title":"Comput. J."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"3085","DOI":"10.1016\/j.ins.2011.02.019","article-title":"Embedding meshes into twisted-cubes","volume":"181","author":"Wang","year":"2011","journal-title":"Inf. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1016\/j.tcs.2010.12.061","article-title":"Constructing independent spanning trees for locally twisted cubes","volume":"412","author":"Liu","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"You, L., and Han, Y. (2014, January 24\u201327). An algorithm to embed a family of node-disjoint 3D meshes into locally twisted cubes. Proceedings of the Algorithms and Architectures for Parallel Processing 14th International Conference, Dalian, China.","DOI":"10.1007\/978-3-319-11194-0_17"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/7\/1349\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:04:52Z","timestamp":1760126692000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/7\/1349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,2]]},"references-count":32,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2023,7]]}},"alternative-id":["sym15071349"],"URL":"https:\/\/doi.org\/10.3390\/sym15071349","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2023,7,2]]}}}