[1] Efe K. The crossed cube architecture for parallel computation. IEEE Transactions on Parallel and Distributed Systems, 1992, 3(5): 513524.
[2] Chang C P, Sung T Y, Hsu L H. Edge congestion and topological properties of crossed cubes. IEEE Transactions on Parallel and Distributed Systems, 2000, 11(1): 6480.
[3] Loh P K K, Hsu W J, Pan Y. The exchanged hypercube. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(9): 866874.
[4] Li K Q, Mu Y P, Li K Q, Min G Y. Exchanged crossed cube: A novel interconnection network for parallel computation. IEEE Transactions on Parallel and Distributed Systems, 2013, 24(11): 22112219.
[5] Ning W T. The super connectivity of exchanged crossed cube. Information Processing Letters, 2016, 116(2): 8084.
[6] Ning W T, Feng X L, Wang L. The connectivity of exchanged crossed cube. Information Processing Letters, 2015, 115(2): 394396.
[7] Auletta L, Rescigno A A, Scarano V. Embedding graphs onto the supercube. IEEE Transactions on Computers, 1995, 44(4): 593597.
[8] Hsu H C, Li T K, Tan J J, Hsu L H. Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs. IEEE Transactions on Computers, 2004, 53(1): 3953.
[9] Kulasinghe P, Bettayeb S. Embedding binary trees into crossed cubes. IEEE Transactions on Computers, 1995, 44(7): 923929.
[10] Patel A, Kusalik A, McCrosky C. Areaefficient VLSI layouts for binary hypercubes. IEEE Transactions on Computers, 2000, 49(2): 160169.
[11] Chaudhary V, Aggarwal J K. A generalized scheme for mapping parallel algorithms. IEEE Transactions on Parallel and Distributed Systems, 1993, 4(3): 328346.
[12] Cheng D, Hao R X, Feng Y Q. Embedding even cycles on folded hypercubes with conditional faulty edges. Information Processing Letters, 2015, 115(12): 945949.
[13] Fan J X, Jia X H. Embedding meshes into crossed cubes. Information Sciences, 2007, 177(15): 31513160.
[14] Fan J X, Jia X H, Lin X L. Complete path embeddings in crossed cubes. Information Sciences, 2006, 176(22): 3332 3346.
[15] Fan J X, Lin X L, Jia X H. Optimal path embedding in crossed cubes. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(12): 11901200.
[16] Fu J S. Longest faultfree paths in hypercubes with vertex faults. Information Sciences, 2006, 176(7): 759771.
[17] Kao S S, Lin C K, Huang H M, Hsu L H. Pancyclicity, panconnectivity, and panpositionability for general graphs and bipartite graphs. Ars Combinatoria, 2012, 105(105): 231246.
[18] Tsai P Y, Lin Y T. Cycle embedding in alternating group graphs with faulty elements. In Proc. the 8th HumanCom and EMC, Aug. 2013, p.1281.
[19] Tsai C H, Lai C J. A linear algorithm for embedding of cycles in crossed cubes with edgepancyclic. Journal of Information Science and Engineering, 2015, 31(4): 13471355.
[20] Wang D J. Hamiltonian embedding in crossed cubes with failed links. IEEE Transactions on Parallel and Distributed Systems, 2012, 23(11): 21172124.
[21] Andrews M, Chuzhoy J, Guruswami V, Khanna, S, Talwar, K, Zhang L S. Inapproximability of edgedisjoint paths and low congestion routing on undirected graphs. Combinatorica, 2010, 30(5): 485520.
[22] Wu R Y, Chen G H, Kuo Y L, Chang G J. Nodedisjoint paths in hierarchical hypercube networks. Information Sciences, 2007, 177(19): 42004207.
[23] Lai P L, Hsu H C. Constructing the nearly shortest path in crossed cubes. Information Sciences, 2009, 179(14): 2487 2493.
[24] Boppana R V, Chalasani S, Raghavendra C S. Resource deadlocks and performance of wormhole multicast routing algorithms. IEEE Transactions on Parallel and Distributed Systems, 1998, 9(6): 535549.
[25] Huang W T, Chuang Y C, Tan J J M et al. On the faulttolerant hamiltonicity of faulty crossed cubes. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2002, E85A(6): 13591370.
[26] Chang T W, Navrátil O, Peng S L. The endtoend longest path problem on a mesh with a missing vertex. Frontiers in Artificial Intelligence and Applications, 2015, 274: 5966.
[27] Fan J X, Lin X L, Pan Y, Jia X H. Optimal faulttolerant embedding of paths in twisted cubes. Journal of Parallel and Distributed Computing, 2007, 67(2): 205214.
[28] Hsieh S Y. Embedding longest faultfree paths onto star graphs with more vertex faults. Theoretical Computer Science, 2005, 337(1/2/3): 370378.
[29] Hsieh S Y, Chang N W. Hamiltonian path embedding and pancyclicity on the Möbius cube with faulty nodes and faulty edges. IEEE Transactions on Computers, 2006, 55(7): 854863.
[30] Hsieh S Y, Lin T J. Panconnectivity and edgepancyclicity of kary ncubes. Networks, 2009, 54(1): 111.
[31] Lin M, Liu H M. Paths and cycles embedding on faulty enhanced hypercube networks. Acta Mathematica Scientia, 2013, 33(1): 227246.
[32] Ma M J, Liu G Z, Xu J M. Faulttolerant embedding of paths in crossed cubes. Theoretical Computer Science, 2008, 407(1/2/3): 110116.
[33] Tsai C H, Jiang S Y. Path bipancyclicity of hypercubes. Information Processing Letters, 2007, 101(3): 9397.
[34] Xu J M, Ma M J. Survey on path and cycle embedding in some networks. Frontiers of Mathematics in China, 2009, 4(2): 217252.
[35] Bondy J A, Murty U S R. Graph Theory with Applications. Citeseer Publisher, 1976.
[36] Zhou D F, Fan J X, Lin C K, Zhou J Y, Wang X. Cycles embedding in exchanged crossed cube. International Journal of Foundations of Computer Science, 2017, 28(1): 6176.
