{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:34:34Z","timestamp":1784644474636,"version":"3.55.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:00Z","timestamp":1758585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:00Z","timestamp":1758585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23B2002"],"award-info":[{"award-number":["U23B2002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302235"],"award-info":[{"award-number":["62302235"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372248"],"award-info":[{"award-number":["62372248"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07843-1","type":"journal-article","created":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T02:53:53Z","timestamp":1758596033000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructing completely independent spanning trees in the generalized hypercube network"],"prefix":"10.1007","volume":"81","author":[{"given":"Hui","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huaqun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengjie","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weibei","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,23]]},"reference":[{"key":"7843_CR1","doi-asserted-by":"publisher","unstructured":"Abts D, Marty MR, Wells PM, Klausler P, Liu H (2010) Energy proportional datacenter networks. In Proceeding International Symposium on Computer Architecture 338\u2013347. https:\/\/doi.org\/10.1145\/1815961.1816004","DOI":"10.1145\/1815961.1816004"},{"key":"7843_CR2","doi-asserted-by":"crossref","unstructured":"Ahn JH, Binkert NL, Davis A, McLaren M, Schreiber RS (2009) HyperX: topology, routing, and packaging of efficient large-scale networks. In Proceeding High Performance Computing Networking, Storage and Analysis 41: 1\u201311","DOI":"10.1145\/1654059.1654101"},{"issue":"3","key":"7843_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/jgt.21780","volume":"77","author":"T Araki","year":"2014","unstructured":"Araki T (2014) Dirac\u2019s condition for completely independent spanning trees. J Graph Theory 77(3):171\u2013179. https:\/\/doi.org\/10.1002\/jgt.21780","journal-title":"J Graph Theory"},{"issue":"4","key":"7843_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TC.1984.1676437","volume":"33","author":"LN Bhuyan","year":"1984","unstructured":"Bhuyan LN, Agrawal DP (1984) Generalized hypercube and hyperbus structures for a computer network. IEEE Trans Comput 33(4):323\u2013333. https:\/\/doi.org\/10.1109\/TC.1984.1676437","journal-title":"IEEE Trans Comput"},{"issue":"10","key":"7843_CR5","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1587\/transfun.E98.A.2191","volume":"98\u2013A","author":"H-Y Chang","year":"2015","unstructured":"Chang H-Y, Wang H-L, Yang J-S, Chang J-M (2015) A note on the degree condition of completely independent spanning trees. IEICE Trans Fundam Electron Commun Comput Sci 98\u2013A(10):2191\u20132193","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"6","key":"7843_CR6","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1109\/12.53599","volume":"19","author":"WJ Dally","year":"1990","unstructured":"Dally WJ (1990) Performance analysis of $$k$$-ARY $$n$$-cube interconnection networks. IEEE Trans Comput 19(6):775\u2013785. https:\/\/doi.org\/10.1109\/12.53599","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"7843_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(95)00173-5","volume":"57","author":"D-R Duh","year":"1996","unstructured":"Duh D-R, Chen G-H, Hsu DF (1996) Combinatorial properties of generalized hypercube graphs. Inf Process Lett 57(1):41\u201345. https:\/\/doi.org\/10.1016\/0020-0190(95)00173-5","journal-title":"Inf Process Lett"},{"issue":"10\u201311","key":"7843_CR8","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1016\/S0167-8191(05)80039-0","volume":"17","author":"TH Dunigan","year":"1991","unstructured":"Dunigan TH (1991) Performance of the Intel iPSC\/860 and Ncube 6400 hypercubes. Parallel Comput 17(10\u201311):1285\u20131302. https:\/\/doi.org\/10.1016\/S0167-8191(05)80039-0","journal-title":"Parallel Comput"},{"issue":"2","key":"7843_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jpdc.1996.0012","volume":"32","author":"P Fragopoulou","year":"1996","unstructured":"Fragopoulou P, Akl SG, Meijer H (1996) Optimal communication primitives on the generalized hypercube network. J Parallel Distribut Comput 32(2):173\u2013187. https:\/\/doi.org\/10.1006\/jpdc.1996.0012","journal-title":"J Parallel Distribut Comput"},{"key":"7843_CR10","doi-asserted-by":"publisher","unstructured":"Guo C, Lu G, Li D et al (2009) BCube: a high performance, server-centric network architecture for modular data centers. In Proceeding Applications, Technologies, Architectures, and Protocols for Computer Communications 63\u201374. https:\/\/doi.org\/10.1145\/1592568.1592577","DOI":"10.1145\/1592568.1592577"},{"issue":"11","key":"7843_CR11","doi-asserted-by":"publisher","first-page":"15105","DOI":"10.1007\/s11227-024-06042-8","volume":"80","author":"ZA Hussain","year":"2024","unstructured":"Hussain ZA, Alazemi F, AlBdaiwi BF (2024) Completely independent spanning trees in Eisenstein-Jacobi networks. J Supercomput 80(11):15105\u201315121. https:\/\/doi.org\/10.1007\/s11227-024-06042-8","journal-title":"J Supercomput"},{"key":"7843_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.dam.2023.07.001","volume":"340","author":"X Chen","year":"2023","unstructured":"Chen X, Liu Q, Yang X (2023) Two completely independent spanning trees of split graphs. Discret Appl Math 340:76\u201378. https:\/\/doi.org\/10.1016\/j.dam.2023.07.001","journal-title":"Discret Appl Math"},{"issue":"5","key":"7843_CR13","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1142\/S0129054123500156","volume":"35","author":"H-J Lin","year":"2024","unstructured":"Lin H-J, Tang S-M, Pai K-J, Chang J-M (2024) A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks. Int J Found Comput Sci 35(5):535\u2013550. https:\/\/doi.org\/10.1142\/S0129054123500156","journal-title":"Int J Found Comput Sci"},{"key":"7843_CR14","doi-asserted-by":"publisher","unstructured":"Kessler RE, Schwarzmeier JL (1993) Cray T3D: A new dimension for cray research. In Proceeding COMPCON 176\u2013182. https:\/\/doi.org\/10.1109\/CMPCON.1993.289660","DOI":"10.1109\/CMPCON.1993.289660"},{"issue":"11","key":"7843_CR15","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.1109\/TC.2015.2389847","volume":"64","author":"D Li","year":"2015","unstructured":"Li D, Wu J (2015) On data center network architectures for interconnecting dual-port servers. IEEE Trans Comput 64(11):3210\u20133222. https:\/\/doi.org\/10.1109\/TC.2015.2389847","journal-title":"IEEE Trans Comput"},{"key":"7843_CR16","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.jpdc.2022.05.010","volume":"167","author":"X-Y Li","year":"2022","unstructured":"Li X-Y, Lin W, Guo W, Chang J-M (2022) A secure data transmission scheme based on multi-protection routing in datacenter networks. J Parallel Distribut Comput 167:222\u2013231. https:\/\/doi.org\/10.1016\/j.jpdc.2022.05.010","journal-title":"J Parallel Distribut Comput"},{"issue":"4","key":"7843_CR17","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1109\/TNET.2022.3147320","volume":"30","author":"X-Y Li","year":"2022","unstructured":"Li X-Y, Lin W, Chang J-M, Jia X (2022) Transmission failure analysis of multi-protection routing in data center networks with heterogeneous edge-core servers. IEEE\/ACM Trans Netw 30(4):1689\u20131702. https:\/\/doi.org\/10.1109\/TNET.2022.3147320","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"8","key":"7843_CR18","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1109\/TPDS.2021.3133595","volume":"33","author":"X-Y Li","year":"2022","unstructured":"Li X-Y, Lin W, Liu X, Lin C-K, Pai K-J, Chang J-M (2022) Completely independent spanning trees on BCCC data center networks with an application to fault-tolerant routing. IEEE Trans Parallel Distrib Syst 33(8):1939\u20131952. https:\/\/doi.org\/10.1109\/TPDS.2021.3133595","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"6","key":"7843_CR19","doi-asserted-by":"publisher","first-page":"94","DOI":"10.11896\/j.issn.1002-137X.2017.06.016","volume":"44","author":"C-K Lin","year":"2017","unstructured":"Lin C-K, Zhao Y, Fan J, Cheng B (2017) Research on completely independent spanning trees based on degree of vertices. Comput Sci 44(6):94\u201396. https:\/\/doi.org\/10.11896\/j.issn.1002-137X.2017.06.016","journal-title":"Comput Sci"},{"key":"7843_CR20","doi-asserted-by":"publisher","unstructured":"Moinet A, Darties B, Gastineau N, Baril J-L, Togni O (2017) Completely independent spanning trees for enhancing the robustness in ad-hoc networks. in Proc. Wireless and Mobile Computing, Networking and Communications 63\u201370. https:\/\/doi.org\/10.1109\/WiMOB.2017.8115791","DOI":"10.1109\/WiMOB.2017.8115791"},{"issue":"2\/3","key":"7843_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1147\/rd.492.0265","volume":"49","author":"RA Narasimha","year":"2005","unstructured":"Narasimha RA, Matthias AB, Dong C et al (2005) Blue Gene\/L torus interconnection network. IBM J Res Dev 49(2\/3):265\u2013276. https:\/\/doi.org\/10.1147\/rd.492.0265","journal-title":"IBM J Res Dev"},{"key":"7843_CR22","doi-asserted-by":"publisher","unstructured":"Noakes MD, Wallach DA, Dally WJ (1993) The J-machine multicomputer: An architectural evaluation. in Proc. Annual International Symposium on Computer Architecture 224\u2013235. https:\/\/doi.org\/10.1145\/165123.165158","DOI":"10.1145\/165123.165158"},{"key":"7843_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-35452-6_13","volume":"1","author":"K-J Pai","year":"2013","unstructured":"Pai K-J, Tang S-M, Chang J-M, Yang J-S (2013) Completely independent spanning trees on complete graphs, complete bipartite graphs and complete tripartite graphs. Adv Intell Syst Appl 1:107\u2013113. https:\/\/doi.org\/10.1007\/978-3-642-35452-6_13","journal-title":"Adv Intell Syst Appl"},{"key":"7843_CR24","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2016.08.024","volume":"652","author":"K-J Pai","year":"2016","unstructured":"Pai K-J, Chang J-M (2016) Constructing two completely independent spanning trees in hypercube-variant networks. Theoret Comput Sci 652:28\u201337. https:\/\/doi.org\/10.1016\/j.tcs.2016.08.024","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"7843_CR25","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TNET.2019.2910019","volume":"27","author":"K-J Pai","year":"2019","unstructured":"Pai K-J, Chang J-M (2019) Dual-CISTs: configuring a protection routing on some Cayley networks. IEEE\/ACM Trans Netw 27(3):1112\u20131123. https:\/\/doi.org\/10.1109\/TNET.2019.2910019","journal-title":"IEEE\/ACM Trans Netw"},{"key":"7843_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2020.02.007","volume":"140","author":"K-J Pai","year":"2020","unstructured":"Pai K-J, Chang R-S, Chang J-M (2020) A protection routing with secure mechanism in M\u00f6bius cubes. J Parallel Distribut Comput 140:1\u201312. https:\/\/doi.org\/10.1016\/j.jpdc.2020.02.007","journal-title":"J Parallel Distribut Comput"},{"key":"7843_CR27","doi-asserted-by":"publisher","first-page":"124546","DOI":"10.1016\/j.amc.2019.06.060","volume":"362","author":"X-W Qin","year":"2019","unstructured":"Qin X-W, Chang J-M, Hao R-X (2019) Constructing dual-CISTs of DCell data center networks. Appl Math Comput 362:124546. https:\/\/doi.org\/10.1016\/j.amc.2019.06.060","journal-title":"Appl Math Comput"},{"issue":"7","key":"7843_CR28","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1109\/TC.2022.3230288","volume":"72","author":"W Lin","year":"2023","unstructured":"Lin W, Li X-Y, Chang J-M, Jia X (2023) Constructing multiple CISTs on BCube-based data center networks in the occurrence of switch failures. IEEE Trans Comput 72(7):1971\u20131984. https:\/\/doi.org\/10.1109\/TC.2022.3230288","journal-title":"IEEE Trans Comput"},{"issue":"6","key":"7843_CR29","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1109\/TC.2025.3547161","volume":"74","author":"H Dong","year":"2025","unstructured":"Dong H, Wang H, Lv M, Fan W (2025) Reliable communication scheme based on completely independent spanning trees in data center networks. IEEE Trans Comput 74(6):2003\u20132016. https:\/\/doi.org\/10.1109\/TC.2025.3547161","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"7843_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TPDS.2019.2931904","volume":"31","author":"X-W Qin","year":"2020","unstructured":"Qin X-W, Hao R-X, Chang J-M (2020) The existence of completely independent spanning trees for some compound graphs. IEEE Trans Parallel Distrib Syst 31(1):201\u2013210. https:\/\/doi.org\/10.1109\/TPDS.2019.2931904","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"6","key":"7843_CR31","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad Y, Schultz MH (1988) Topological properties of hypercubes. IEEE Trans Comput 37(6):867\u2013872. https:\/\/doi.org\/10.1109\/12.2234","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"7843_CR32","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/TPDS.2019.2941207","volume":"31","author":"G Wang","year":"2020","unstructured":"Wang G, Lin C-K, Fan J, Cheng B, Jia X (2020) A novel low cost interconnection architecture based on the generalized hypercube. IEEE Trans Parallel Distrib Syst 31(3):647\u2013662. https:\/\/doi.org\/10.1109\/TPDS.2019.2941207","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"12","key":"7843_CR33","doi-asserted-by":"publisher","first-page":"2979","DOI":"10.1093\/comjnl\/bxab120","volume":"65","author":"Y Wang","year":"2022","unstructured":"Wang Y, Cheng B, Fan J, Qian Y, Jiang R (2022) An algorithm to construct completely independent spanning trees in line graphs. Comput J 65(12):2979\u20132990. https:\/\/doi.org\/10.1093\/comjnl\/bxab120","journal-title":"Comput J"},{"issue":"5","key":"7843_CR34","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1109\/TC.2021.3077587","volume":"71","author":"Y Wang","year":"2022","unstructured":"Wang Y, Cheng B, Qian Y, Wang D (2022) Constructing completely independent spanning trees in a family of line-graph-based data center networks. IEEE Trans Comput 71(5):1194\u20131203. https:\/\/doi.org\/10.1109\/TC.2021.3077587","journal-title":"IEEE Trans Comput"},{"key":"7843_CR35","doi-asserted-by":"publisher","unstructured":"Zenios SA, Lasken R (1988) The connection machines CM-1 and CM-2: solving nonlinear network problems. In Proceeding International Conference on Supercomputing 648\u2013658. https:\/\/doi.org\/10.1145\/55364.55428","DOI":"10.1145\/55364.55428"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07843-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07843-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07843-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T02:53:58Z","timestamp":1758596038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07843-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,23]]},"references-count":35,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["7843"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07843-1","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,23]]},"assertion":[{"value":"2 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1371"}}