{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:48:34Z","timestamp":1768520914392,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["110-2221-E-141-004"],"award-info":[{"award-number":["110-2221-E-141-004"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10878-022-00863-0","type":"journal-article","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T19:02:58Z","timestamp":1652122978000},"page":"3194-3211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constructing tri-CISTs in shuffle-cubes"],"prefix":"10.1007","volume":"44","author":[{"given":"Yu-Han","family":"Chen","sequence":"first","affiliation":[]},{"given":"Kung-Jui","family":"Pai","sequence":"additional","affiliation":[]},{"given":"Hsin-Jung","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-7968","authenticated-orcid":false,"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,9]]},"reference":[{"issue":"3","key":"863_CR1","doi-asserted-by":"publisher","first-page":"1850012","DOI":"10.1142\/S0129626418500123","volume":"28","author":"S Anantapantula","year":"2018","unstructured":"Anantapantula S, Melekian C, Cheng E (2018) Matching preclusion for the shuffle-cubes. Parallel Process Lett 28(3):1850012","journal-title":"Parallel Process Lett"},{"issue":"3","key":"863_CR2","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","journal-title":"J Graph Theory"},{"issue":"10","key":"863_CR3","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1587\/transfun.E98.A.2191","volume":"E98\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 E98\u2013A(10):2191\u20132193","journal-title":"IEICE Trans Fundam"},{"issue":"9","key":"863_CR4","doi-asserted-by":"publisher","first-page":"1932","DOI":"10.1587\/transfun.E100.A.1932","volume":"E100\u2013A","author":"J-M Chang","year":"2017","unstructured":"Chang J-M, Chang H-Y, Wang H-L, Pai K-J, Yang J-S (2017) Completely independent spanning trees on 4-regular chordal rings. IEICE Trans Fundam E100\u2013A(9):1932\u20131935","journal-title":"IEICE Trans Fundam"},{"key":"863_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2020.12.023","volume":"856","author":"Y-H Chang","year":"2021","unstructured":"Chang Y-H, Pai K-J, Hsu C-C, Yang J-S, Chang J-M (2021) Constructing dual-CISTs of folded divide-and-swap cubes. Theor Comput Sci 856:75\u201387","journal-title":"Theor Comput Sci"},{"key":"863_CR6","doi-asserted-by":"crossref","unstructured":"Chen G, Cheng B, Wang D (2021a) Constructing completely independent spanning trees in data center network based on augmented cube. IEEE Trans Parallel Distrib Syst 32(3):665\u2013673","DOI":"10.1109\/TPDS.2020.3029654"},{"key":"863_CR7","doi-asserted-by":"crossref","unstructured":"Chen Y-H, Tang S-M, Pai K-J, Chang J-M (2021b) Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes. Theor Comput Sci 878\u2013879:102\u2013112","DOI":"10.1016\/j.tcs.2021.05.031"},{"key":"863_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.dam.2016.11.019","volume":"219","author":"B Cheng","year":"2017","unstructured":"Cheng B, Wang D, Fan J (2017) Constructing completely independent spanning trees in crossed cubes. Discrete Appl Math 219:100\u2013109","journal-title":"Discrete Appl Math"},{"issue":"2","key":"863_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.dam.2016.09.007","volume":"217","author":"B Darties","year":"2017","unstructured":"Darties B, Gastineau N, Togni O (2017) Completely independent spanning trees in some regular graphs. Discrete Appl Math 217(2):163\u2013174","journal-title":"Discrete Appl Math"},{"key":"863_CR10","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2020.06.015","volume":"835","author":"T Ding","year":"2020","unstructured":"Ding T, Li P, Xu M (2020) The component (edge) connectivity of shuffle-cubes. Theor Comput Sci 835:108\u2013119","journal-title":"Theor Comput Sci"},{"issue":"2","key":"863_CR11","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/TC.2005.33","volume":"54","author":"J Fan","year":"2005","unstructured":"Fan J, Lin X (2005) The $$t\/k$$-diagnosability of the BC graphs. IEEE Trans Comput 54(2):176\u2013184","journal-title":"IEEE Trans Comput"},{"key":"863_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.dam.2014.06.002","volume":"177","author":"G Fan","year":"2014","unstructured":"Fan G, Hong Y, Liu Q (2014) Ore\u2019s condition for completely independent spanning trees. Discrete Appl Math 177:95\u2013100","journal-title":"Discrete Appl Math"},{"issue":"1\u20133","key":"863_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0012-365X(00)00377-0","volume":"234","author":"T Hasunuma","year":"2001","unstructured":"Hasunuma T (2001) Completely independent spanning trees in the underlying graph of a line digraph. Discrete Math 234(1\u20133):149\u2013157","journal-title":"Discrete Math"},{"key":"863_CR14","doi-asserted-by":"crossref","unstructured":"Hasunuma T (2002) Completely independent spanning trees in maximal planar graphs. In: Proceedings of the 28th graph-theoretic concepts computer science (WG2002), lecture notes in computer science, vol 2573, Springer, Cham, pp 235\u2013245","DOI":"10.1007\/3-540-36379-3_21"},{"key":"863_CR15","doi-asserted-by":"crossref","unstructured":"Hasunuma T (2016) Minimum degree conditions and optimal graphs for completely independent spanning trees. In: Proceedings of 26th international workshop on combinatorial algorithms (IWOCA 2016), lecture notes in computer science, vol 9538, Springer, Cham, pp 260\u2013273","DOI":"10.1007\/978-3-319-29516-9_22"},{"issue":"1","key":"863_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.20460","volume":"60","author":"T Hasunuma","year":"2012","unstructured":"Hasunuma T, Morisaka C (2012) Completely independent spanning trees in torus networks. Networks 60(1):59\u201369","journal-title":"Networks"},{"issue":"10","key":"863_CR17","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ipl.2016.05.004","volume":"116","author":"X Hong","year":"2016","unstructured":"Hong X, Liu Q (2016) Degree condition for completely independent spanning trees. Inf Process Lett 116(10):644\u2013648","journal-title":"Inf Process Lett"},{"key":"863_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2019.08.013","volume":"279","author":"X Hong","year":"2020","unstructured":"Hong X, Zhang H (2020) A Hamilton sufficient condition for completely independent spanning tree. Discrete Appl Math 279:183\u2013187","journal-title":"Discrete Appl Math"},{"issue":"5","key":"863_CR19","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1109\/TNET.2011.2123916","volume":"19","author":"K-W Kwong","year":"2011","unstructured":"Kwong K-W, Gao L, Gu\u00e9rin R, Zhang Z-L (2011) On the feasibility and efficacy of protection routing in IP networks. IEEE\/ACM Trans Netw 19(5):1543\u20131556","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"1","key":"863_CR20","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0020-0190(00)00147-2","volume":"77","author":"T-K Li","year":"2001","unstructured":"Li T-K, Tan JM, Hsu L-H, Sung TY (2001) The shuffle-cubes and their generalization. Inf Process Lett 77(1):35\u201341","journal-title":"Inf Process Lett"},{"key":"863_CR21","unstructured":"Li T-K, Tan JM, Hsu L-H (2002) Fault hamiltonicity of the shuffle-cubes. In: Proceedings of 19th workshop on combinatorial mathematics and computation theory, Kaohsiung, Taiwan, pp 110\u2013119"},{"issue":"2","key":"863_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1080\/23799927.2019.1625949","volume":"4","author":"J Li","year":"2019","unstructured":"Li J, Lin L, Huang Y, Yu H, Chen R (2019) The $$(t, k)$$-diagnosability of shuffle-cubes under PMC model. Int J Comput Math Comput Syst Theor 4(2):111\u2013126","journal-title":"Int J Comput Math Comput Syst Theor"},{"issue":"2","key":"863_CR23","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1080\/00207160.2014.900548","volume":"92","author":"L Lin","year":"2015","unstructured":"Lin L, Xu L, Zhou S (2015) Conditional diagnosability and strong diagnosability of shuffle-cubes under the comparison model. Int J Comput Math 92(2):230\u2013249","journal-title":"Int J Comput Math"},{"key":"863_CR24","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.jpdc.2018.08.006","volume":"122","author":"SA Mane","year":"2018","unstructured":"Mane SA, Kandekar SA, Waphare BN (2018) Constructing spanning trees in augmented cubes. J Parallel Distrib Comput 122:188\u2013194","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"863_CR25","doi-asserted-by":"publisher","first-page":"427","DOI":"10.7151\/dmgt.1806","volume":"35","author":"M Matsushita","year":"2015","unstructured":"Matsushita M, Otachi Y, Araki T (2015) Completely independent spanning trees in (partial) $$k$$-trees. Discuss Math Graph Theory 35(3):427\u2013437","journal-title":"Discuss Math Graph Theory"},{"key":"863_CR26","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. Theor Comput Sci 652:28\u201337","journal-title":"Theor Comput Sci"},{"key":"863_CR27","doi-asserted-by":"crossref","unstructured":"Pai K-J, Chang J-M (2019a) Improving the diameters of completely independent spanning trees in locally twisted cubes. Inf Process Lett 141:22\u201324","DOI":"10.1016\/j.ipl.2018.09.006"},{"key":"863_CR28","doi-asserted-by":"crossref","unstructured":"Pai K-J, Chang J-M (2019b) Dual-CISTs: configuring a protection routing on some Cayley networks. IEEE\/ACM Trans Netw 27(3):1112\u20131123","DOI":"10.1109\/TNET.2019.2910019"},{"issue":"9","key":"863_CR29","doi-asserted-by":"publisher","first-page":"2514","DOI":"10.1587\/transinf.2014EDL8079","volume":"E97\u2013D","author":"K-J Pai","year":"2014","unstructured":"Pai K-J, Yang J-S, Yao S-C, Tang S-M, Chang J-M (2014) Completely independent spanning trees on some interconnection networks. IEICE Trans Inf Syst E97\u2013D(9):2514\u20132517","journal-title":"IEICE Trans Inf Syst"},{"key":"863_CR30","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2019.03.035","volume":"784","author":"K-J Pai","year":"2019","unstructured":"Pai K-J, Chang R-S, Wu R-Y, Chang J-M (2019) A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theor Comput Sci 784:65\u201374","journal-title":"Theor Comput Sci"},{"key":"863_CR31","doi-asserted-by":"crossref","unstructured":"Pai K-J, Chang R-S, Chang J-M (2020a) A protection routing with secure mechanism in M\u00f6bius cubes. J Parallel Distrib Comput 140:1\u201312","DOI":"10.1016\/j.jpdc.2020.02.007"},{"key":"863_CR32","doi-asserted-by":"crossref","unstructured":"Pai K-J, Chang R-S, Chang J-M (2020b) A well-equalized 3-CIST partition of alternating group graphs. Inf Process Lett 155:105874","DOI":"10.1016\/j.ipl.2019.105874"},{"key":"863_CR33","doi-asserted-by":"crossref","unstructured":"Pai K-J, Chang R-S, Wu R-Y, Chang J-M (2020c) Three completely independent spanning trees of crossed cubes with application to secure-potection routing. Inf Sci 541:516\u2013530","DOI":"10.1016\/j.ins.2020.05.048"},{"issue":"1","key":"863_CR34","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/s11227-020-03297-9","volume":"77","author":"K-J Pai","year":"2021","unstructured":"Pai K-J, Chang R-S, Chang J-M (2021) Constructing dual-CISTs of pancake graphs and performance assessment of protection routings on some Cayley networks. J Supercomput 77(1):990\u20131014","journal-title":"J Supercomput"},{"issue":"4","key":"863_CR35","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.disc.2011.11.015","volume":"312","author":"F P\u00e9terfalvi","year":"2012","unstructured":"P\u00e9terfalvi F (2012) Two counterexamples on completely independent spanning trees. Discrete Math 312(4):808\u2013810","journal-title":"Discrete Math"},{"key":"863_CR36","first-page":"125900","volume":"397","author":"X-W Qin","year":"2021","unstructured":"Qin X-W, Hao R-X (2021) Reliability analysis based on the dual-CIST in shuffle-cubes. Appl Math Comput 397:125900","journal-title":"Appl Math Comput"},{"key":"863_CR37","first-page":"124546","volume":"362","author":"X-W Qin","year":"2019","unstructured":"Qin X-W, Hao R-X, Chang J-M (2019) Constructing dual-CISTs of DCell data center networks. Appl Math Comput 362:124546","journal-title":"Appl Math Comput"},{"key":"863_CR38","doi-asserted-by":"crossref","unstructured":"Qin X-W, Hao R-X, Chang J-M (2020a) The existence of completely independent spanning trees for some compound graphs. IEEE Trans Parallel Distrib Syst 31(1):201\u2013210","DOI":"10.1109\/TPDS.2019.2931904"},{"key":"863_CR39","doi-asserted-by":"crossref","unstructured":"Qin X-W, Hao R-X, Pai K-J, Chang J-M (2020b) Comments on A Hamilton sufficient condition for completely independent spanning tree. Discrete Appl Math 283:730\u2013733","DOI":"10.1016\/j.dam.2020.01.024"},{"issue":"4","key":"863_CR40","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s11590-012-0455-y","volume":"7","author":"J Tapolcai","year":"2013","unstructured":"Tapolcai J (2013) Sufficient conditions for protection routing in IP networks. Optim Lett 7(4):723\u2013730","journal-title":"Optim Lett"},{"issue":"8","key":"863_CR41","first-page":"66","volume":"3","author":"Y Wang","year":"2017","unstructured":"Wang Y, Wang S, Wang Z (2017) The 1-good-neighbor diagnosability of shuffle-cubes. Int J New Technol Res 3(8):66\u201373","journal-title":"Int J New Technol Res"},{"issue":"4","key":"863_CR42","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ipl.2005.07.005","volume":"96","author":"J-M Xu","year":"2005","unstructured":"Xu J-M, Xu M, Zhu Q (2005) The super connectivity of shuffle-cubes. Inf Process Lett 96(4):123\u2013127","journal-title":"Inf Process Lett"},{"issue":"1","key":"863_CR43","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11424-010-9271-6","volume":"23","author":"M Xu","year":"2010","unstructured":"Xu M, Hu X, Shang S (2010) The conditional diagnosability of shuffle-cubes. J Syst Sci Complex 23(1):81\u201390","journal-title":"J Syst Sci Complex"},{"issue":"12","key":"863_CR44","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1587\/transinf.2019PAL0001","volume":"E102\u2013D","author":"Y-X Yang","year":"2019","unstructured":"Yang Y-X, Pai K-J, Chang R-S, Chang J-M (2019) Constructing two completely independent spanning trees in balanced hypercubes. IEICE Tran Inf Syst E102\u2013D(12):2409\u20132412","journal-title":"IEICE Tran Inf Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00863-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00863-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00863-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:38:31Z","timestamp":1667036311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00863-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,9]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["863"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00863-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,9]]},"assertion":[{"value":"11 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}