{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T09:39:32Z","timestamp":1768815572873,"version":"3.49.0"},"reference-count":35,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:p>Let G be a simple undirected graph, a set of spanning trees of G are completely independent spanning trees (CISTs for short) if for any two vertices [Formula: see text], the (u, v)-paths in these trees have neither vertex nor edge in common, except u and v. Hasunuma\u00a0[ 1 , 2 ] proposed that there are k CISTs in any [Formula: see text]-connected graph. However, P\u00e9terfalvi\u00a0[ 3 ] disproved this by constructing k-connected graphs for [Formula: see text], which doesn\u2019t have two CISTs. In this paper, we present an algorithm for the construction of three CISTs within the 5-dimensional folded hypercube ([Formula: see text] for short), since [Formula: see text] is 6-connected graph\u00a0[ 4 ]. Moreover, we also provided an approach to construct three CISTs in any [Formula: see text] where n is greater than 5. In particular, for an [Formula: see text] the diameters of the constructed three CISTs are [Formula: see text].<\/jats:p>","DOI":"10.1142\/s0129054125500078","type":"journal-article","created":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:31:55Z","timestamp":1742959915000},"page":"1227-1241","source":"Crossref","is-referenced-by-count":1,"title":["An Innovative Algorithm for Generating Three Completely Independent Spanning Trees in Folded Hypercube Networks"],"prefix":"10.1142","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6818-0487","authenticated-orcid":false,"given":"Guan-Hao","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6785-4527","authenticated-orcid":false,"given":"Yu-Han","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4746-3179","authenticated-orcid":false,"given":"Sun-Yuan","family":"Hsieh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan"},{"name":"Institution of Medical Informatics, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan"},{"name":"Institute of Manufacturing Information and Systems, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan"},{"name":"Department of Computer Science and Information Engineering, National Chi Nan University, 1 University Road, Puli Township, Nantou County 545301, Taiwan"},{"name":"Institute of Information Science, Academia Sinica, 128 Academia Road, Section 2, Nankang, Taipei 115201, Taiwan"}]}],"member":"219","published-online":{"date-parts":[[2025,3,25]]},"reference":[{"key":"S0129054125500078BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00377-0"},{"key":"S0129054125500078BIB002","doi-asserted-by":"crossref","unstructured":"T. Hasunuma, Completely independent spanning trees in maximal planar graphs, in:\n                      Graph-Theoretic Concepts in Computer Science: 28th International Workshop\n                      , WG 2002 Cesk\u1ef3 Krumlov, Czech Republic, June 13\u201315, 2002 Revised Papers 28 (Springer, 2002), pp. 235\u2013245.","DOI":"10.1007\/3-540-36379-3_21"},{"key":"S0129054125500078BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.11.015"},{"key":"S0129054125500078BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114151"},{"key":"S0129054125500078BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/net.20460"},{"key":"S0129054125500078BIB006","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21780"},{"key":"S0129054125500078BIB007","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E98.A.2191"},{"key":"S0129054125500078BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.06.002"},{"key":"S0129054125500078BIB009","first-page":"260","volume-title":"International Workshop on Combinatorial Algorithms","author":"Hasunuma T.","year":"2015"},{"key":"S0129054125500078BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113080"},{"key":"S0129054125500078BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2023.07.001"},{"key":"S0129054125500078BIB012","volume":"39","author":"Hasunuma T.","year":"2022","journal-title":"Graphs and Combinatorics"},{"key":"S0129054125500078BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-023-02622-2"},{"key":"S0129054125500078BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2024.08.020"},{"key":"S0129054125500078BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/WiMOB.2017.8115791"},{"key":"S0129054125500078BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.05.048"},{"key":"S0129054125500078BIB017","first-page":"124546","volume":"362","author":"Qin X.-W.","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"S0129054125500078BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1768-x"},{"key":"S0129054125500078BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.06.018"},{"key":"S0129054125500078BIB020","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E100.A.1932"},{"key":"S0129054125500078BIB021","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2014EDL8079"},{"key":"S0129054125500078BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/WiMOB.2017.8115791"},{"key":"S0129054125500078BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.007"},{"key":"S0129054125500078BIB024","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1806"},{"key":"S0129054125500078BIB025","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35452-6_13"},{"key":"S0129054125500078BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.08.006"},{"key":"S0129054125500078BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.08.024"},{"key":"S0129054125500078BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.03.035"},{"key":"S0129054125500078BIB029","first-page":"1","author":"Lin H.-J.","year":"2023","journal-title":"Int. J. Found. Comput. Sci."},{"key":"S0129054125500078BIB030","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"key":"S0129054125500078BIB031","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.10.032"},{"key":"S0129054125500078BIB032","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.05.031"},{"key":"S0129054125500078BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.09.006"},{"key":"S0129054125500078BIB034","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSN.2017.8230281"},{"key":"S0129054125500078BIB035","doi-asserted-by":"publisher","DOI":"10.1145\/3591110"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054125500078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:07:37Z","timestamp":1765357657000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054125500078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,25]]},"references-count":35,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10.1142\/S0129054125500078"],"URL":"https:\/\/doi.org\/10.1142\/s0129054125500078","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,25]]}}}