{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:04:44Z","timestamp":1777539884270,"version":"3.51.4"},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2019,12,1]]},"DOI":"10.1587\/transinf.2019pal0001","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T11:42:54Z","timestamp":1575286974000},"page":"2409-2412","source":"Crossref","is-referenced-by-count":8,"title":["Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes"],"prefix":"10.1587","volume":"E102.D","author":[{"given":"Yi-Xian","family":"YANG","sequence":"first","affiliation":[{"name":"Institute of Information and Decision Sciences, National Taipei University of Business"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kung-Jui","family":"PAI","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Management, Ming Chi University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruay-Shiung","family":"CHANG","sequence":"additional","affiliation":[{"name":"Institute of Information and Decision Sciences, National Taipei University of Business"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"CHANG","sequence":"additional","affiliation":[{"name":"Institute of Information and Decision Sciences, National Taipei University of Business"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] T. Araki, \u201cDirac&apos;s condition for completely independent spanning trees,\u201d J. Graph Theory, vol.77, no.3, pp.171-179, 2014. 10.1002\/jgt.21780","DOI":"10.1002\/jgt.21780"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] J.-M. Chang, H.-Y. Chang, H.-L. Wang, K.-J. Pai, and J.-S. Yang, \u201cCompletely independent spanning trees on 4-regular chordal rings,\u201d IEICE Trans. Fundamentals, vol.E100-A, no.9, pp.1932-1935, 2017. 10.1587\/transfun.e100.a.1932","DOI":"10.1587\/transfun.E100.A.1932"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] H.-Y. Chang, H.-L. Wang, J.-S. Yang, and J.-M. Chang, \u201cA note on the degree condition of completely independent spanning trees,\u201d IEICE Trans. Fundamentals, vol.E98-A, no.10, pp.2191-2193, 2015. 10.1587\/transfun.e98.a.2191","DOI":"10.1587\/transfun.E98.A.2191"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] D.-Q. Cheng, R.-X. Hao, and Y.-Q. Feng, \u201cTwo node-disjoint paths in balanced hypercubes,\u201d Appl. Math. Comput., vol.242, pp.127-142, 2014. 10.1016\/j.amc.2014.05.037","DOI":"10.1016\/j.amc.2014.05.037"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] B. Cheng, D. Wang, and J. Fan, \u201cConstructing completely independent spanning trees in crossed cubes,\u201d Discrete Appl. Math., vol.219, pp.100-109, 2017. 10.1016\/j.dam.2016.11.019","DOI":"10.1016\/j.dam.2016.11.019"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] B. Darties, N. Gastineau, and O. Togni, \u201cCompletely independent spanning trees in some regular graphs,\u201d Discrete Appl. Math., vol.217, no.2, pp.163-174, 2017. 10.1016\/j.dam.2016.09.007","DOI":"10.1016\/j.dam.2016.09.007"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] G. Fan, Y. Hong, and Q. Liu, \u201cOre&apos;s condition for completely independent spanning trees,\u201d Discrete Appl. Math., vol.177, pp.95-100, 2014. 10.1016\/j.dam.2014.06.002","DOI":"10.1016\/j.dam.2014.06.002"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] M.-M. Gu, R.-X. Hao, and Y.-Q. Feng, \u201cFault-tolerant cycle embedding in balanced hypercubes with faulty vertices and faulty edges,\u201d J. Intercon. Netw., vol.15, no.1-2, 1550002, 2015. 10.1142\/s0219265915500024","DOI":"10.1142\/S0219265915500024"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] M.-M. Gu, R.-X. Hao, and D.-X. Yang, \u201cA short note on the 1,2-good-neighbor diagnosability of balanced hypercubes,\u201d J. Intercon. Netw., vol.16, no.2, 1650001, 2016. 10.1142\/s0219265916500018","DOI":"10.1142\/S0219265916500018"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] M.-M. Gu, R.-X. Hao, and Y.-Q. Feng, \u201cEdge fault-tolerant strong hamiltonian laceability of balanced hypercubes,\u201d J. Intercon. Netw., vol.16, no.2, 1650002, 2016. 10.1142\/s021926591650002x","DOI":"10.1142\/S021926591650002X"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] R.-X. Hao, R. Zhang, Y.-Q. Feng, and J.-X. Zhou, \u201cHamiltonian cycle embedding for fault tolerance in balanced hypercubes,\u201d Appl. Math. Comput., vol.244, pp.447-456, 2014. 10.1016\/j.amc.2014.07.015","DOI":"10.1016\/j.amc.2014.07.015"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] T. Hasunuma, \u201cCompletely independent spanning trees in the underlying graph of a line digraph,\u201d Discrete Math., vol.234, no.1-3, pp.149-157, 2001. 10.1016\/s0012-365x(00)00377-0","DOI":"10.1016\/S0012-365X(00)00377-0"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] T. Hasunuma, \u201cCompletely independent spanning trees in maximal planar graphs,\u201d Proc. Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol.2573, pp.235-245, Springer Berlin Heidelberg, Berlin, Heidelberg, 2002. 10.1007\/3-540-36379-3_21","DOI":"10.1007\/3-540-36379-3_21"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] T. Hasunuma and C. Morisaka, \u201cCompletely independent spanning trees in torus networks,\u201d Networks, vol.60, no.1, pp.59-69, 2012. 10.1002\/net.20460","DOI":"10.1002\/net.20460"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] T. Hasunuma, \u201cMinimum degree conditions and optimal graphs for completely independent spanning trees,\u201d Proc. Combinatorial Algorithms, Lecture Notes in Computer Science, vol.9538, pp.260-273, Springer Berlin Heidelberg, Berlin, Heidelberg, 2016. 10.1007\/978-3-319-29516-9_22","DOI":"10.1007\/978-3-319-29516-9_22"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] X. Hong, \u201cCompletely independent spanning trees in <i>k<\/i>-th power of graphs,\u201d Discus. Math. Graph Theor., vol.38, no.3, pp.801-810, 2018. 10.7151\/dmgt.2038","DOI":"10.7151\/dmgt.2038"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] X. Hong and Q. Liu, \u201cDegree condition for completely independent spanning trees,\u201d Inf. Process. Lett., vol.116, no.10, pp.644-648, 2016. 10.1016\/j.ipl.2016.05.004","DOI":"10.1016\/j.ipl.2016.05.004"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] K. Huang and J. Wu, \u201cArea efficient layout of balanced hypercubes,\u201d Int. J. High Speed Electron. Syst., vol.6, no.4, pp.631-646, 1995.","DOI":"10.1142\/S0129156495000237"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] S.A. Mane, S.A. Kandekar, and B.N. Waphare, \u201cConstructing spanning trees in augmented cubes,\u201d J. Parallel Distrib. Comput., vol.122, pp.188-194, 2018. 10.1016\/j.jpdc.2018.08.006","DOI":"10.1016\/j.jpdc.2018.08.006"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] M. Matsushita, Y. Otachi, and T. Araki, \u201cCompletely independent spanning trees in (partial) <i>k<\/i>-trees,\u201d Discus. Math. Graph Theor., vol.35, no.3, pp.427-437, 2015. 10.7151\/dmgt.1806","DOI":"10.7151\/dmgt.1806"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] K.-J. Pai and J.-M. Chang, \u201cConstructing two completely independent spanning trees in hypercube-variant networks,\u201d Theor. Comput. Sci., vol.652, pp.28-37, 2016. 10.1016\/j.tcs.2016.08.024","DOI":"10.1016\/j.tcs.2016.08.024"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] K.-J. Pai, S.-M. Tang, J.-M. Chang, and J.-S. Yang, \u201cCompletely independent spanning trees on complete graphs, complete bipartite graphs and complete tripartite graphs,\u201d Advances in Intelligent Systems and Applications vol.1, Smart Innovation, Systems and Technologies, vol.20, pp.107-113, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013. 10.1007\/978-3-642-35452-6_13","DOI":"10.1007\/978-3-642-35452-6_13"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] K.-J. Pai, J.-S. Yang, S.-C. Yao, S.-M. Tang, and J.-M. Chang, \u201cCompletely independent spanning trees on some interconnection networks,\u201d IEICE Trans. Inf. &amp; Syst., vol.E97-D, no.9, pp.2514-2517, 2014. 10.1587\/transinf.2014edl8079","DOI":"10.1587\/transinf.2014EDL8079"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] F. P\u00e9terfalvi, \u201cTwo counterexamples on completely independent spanning trees,\u201d Discrete Math., vol.312, no.4, pp.808-810, 2012. 10.1016\/j.disc.2011.11.015","DOI":"10.1016\/j.disc.2011.11.015"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] J. Wu and K. Huang, \u201cThe balanced hypercubes: A cube-based system for fault-tolerant applications,\u201d IEEE Trans. Comput., vol.46, no.4, pp.484-490, 1997. 10.1109\/12.588063","DOI":"10.1109\/12.588063"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] J.-X. Zhou, Z.-L. Wu, S.-C. Yang, and K.-W. Yuan, \u201cSymmetric property and reliability of balanced hypercube,\u201d IEEE Trans. Comput., vol.64, no.3, pp.876-881, 2015. 10.1109\/tc.2014.2304391","DOI":"10.1109\/TC.2014.2304391"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/12\/E102.D_2019PAL0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T22:31:56Z","timestamp":1575671516000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/12\/E102.D_2019PAL0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,1]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019pal0001","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,1]]}}}