Survey on path and cycle embedding in some networks

Frontiers of Mathematics in China

Volumn 4, Issue 2, 2009, Pages 217-252

  Xu, Jun Ming ^a   Ma, Meijie ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b ZHEJIANG NORMAL UNIVERSITY   (China)

Author keywords

Cycle; Embedding; Fault Tolerance; Hamiltonicity; Hypercube like network; Panconnectivity; Pancyclicity; Path

Indexed keywords

EID: 63949084974     PISSN: 16733452     EISSN: 16733576     Source Type: Journal    
DOI: 10.1007/s11464-009-0017-5     Document Type: Article

References (168)

1. Akers S B, Harel D, Krishnamurthy B. The star graph, An attractive alternative to the n-cube. In: Sahni S, ed. Proceedings of the 1987 International Conference on Parallel Processing, August 17-21, 1987. University Park: Pennsylvania State Univ Press, 1987, 393-400
2. Akers S B, Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. In: Proceedings of the 1986 International Conference on Parallel Processing. 1986, 216-223
3. S. B. Akers B. Krisnamurthy 1989 A group theoretic model for symmetric interconnection networks IEEE Transactions on Computers 38 4 555 566
4. Akl S G. Parallel Computation: Models and Methods. Upper Saddle River: Prentice-Hall, 1997
5. Y. Alavi J. E. Williamson 1975 Panconnected graphs Studia Scientiarum Mathematicarum Hungarica 10 1-2 19 22
6. Alspach B, Bermond J C, Sotteau D. Decomposition into cycles I. Hamiltonian decomposition. Technical Report 87-12. Simon Fraser University, 1987
7. B. Alspach D. Hare 1991 Edge-pancyclic block-intersection graphs Discrete Mathematics 97 1-3 17 24
8. T. Araki Y. Kikuchi 2007 Hamiltonian laceability of bubble-sort graphs with edge faults Information Sciences 177 13 2679 2691
9. T. Araki Y. Shibata 2002 Pancyclicity of recursive circulant graphs Information Processing Letters 81 187 190
10. Y. A. Ashir T. A. Stewart 1997 On embedding cycles in k-ary n-cubes Parallel Processing Letters 7 1 49 55
11. Y. A. Ashir I. A. Stewart 2002 Fault-tolerant embedding of Hamiltonian circuits in k-ary n-cube SIAM Journal on Discrete Mathematics 15 3 317 328
12. S. Bettayeb 1995 On the k-ary Hypercube Theoretical Computer Science 140 333 339
13. J. A. Bondy 1971 Pancyclic graphs. I Journal of Combinatorial Theory 11 80 84
14. B. Bose B. Broeg Y. Kwon Y. Ashir 1995 Lee distance and topological properties of k-ary n-cubes IEEE Transactions on Computers 44 1021 1030
15. M. Y. Chan S. J. Lee 1991 On the existence of Hamiltonian circuits in faulty hypercubes SIAM Journal on Discrete Mathematics 4 511 527
16. M. Y. Chan S. J. Lee 1991 Distributed fault-tolerant embedding of rings in hypercubes Journal of Parallel and Distributed Computing 11 63 71
17. C.-H. Chang C.-K. Lin H.-M. Huang L.-H. Hsu 2004 The super laceability of the hypercubes Information Processing Letters 92 1 15 21
18. Chang C-P, Sung T-Y, Hsu L-H. A new shortest path routing algorithm and embedding cycles of crossed cube. Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN'97) Proceedings. Third International Symposium on 18-20 Dec 1997. 125-131
19. C.-P. Chang J.-N. Wang L.-H. Hsu 1999 Topological properties of twisted cube Information Science 113 147 167
20. J.-M. Chang J.-S. Yang Y.-L. Wang Y. Cheng 2004 Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs Networks 44 4 302 310
21. J.-M. Chang J.-S. Yang 2008 Fault-tolerant cycle embedding in alternating group graphs Applied Mathematics and Computation 197 2 760 767
22. Q.-Y. Chang M.-J. Ma J.-M. Xu 2006 Fault-tolerant pancyclicity of locally twisted cubes Journal of University of Science and Technology of China 36 6 607 610
23. Q.-Y. Chang M.-J. Ma J.-M. Xu 2007 Fault-tolerant pancyclicity of twisted cubes Operation Research and Management Science 16 1 52 57
24. G. H. Chen J. S. Fu J. F. Fang 2000 Hypercomplete: a pancylic recursive topology for large-scale distributed multicomputer systems Networks 35 1 56 69
25. G. H. Chen S. C. Hwang 2000 Cycle in butterfly graphs Networks 35 2 161 171
26. M. Y. Chen K. G. Shin 1987 Processor allocation in an n-cube multiprocessor using gray codes IEEE Transactions on Computers 36 1396 1407
27. X.-B. Chen 2007 Cycles passing through prescribed edges in a hypercube with some faulty edges Information Processing Letters 104 6 211 215
28. Chen X-B. Some results on topological properties of folded hypercubes. Information Processing Letters, DOI: 10.1016/j.ipl.2008.12.005
29. Y.-C. Chen C.-H. Tsai L.-H. Hsu J. J. M. Tan 2004 On some super fault-tolerant Hamiltonian graphs Applied Mathematics and Computation 148 729 741
30. Y.-Y. Chen D.-R. Duh T.-L. Ye J.-S. Fu 2008 Weak-vertex-pancyclicity of (n, k)-star graphs Theoretical Computer Science 396 3 191 199
31. E. Cheng M. Lipman 1999 Fault tolerant routing in split-stars and alternating group graphs Congressus Numerantium 139 21 32
32. E. Cheng M.-J. Lipman 2002 Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness Discrete Applied Mathematics 118 3 163 179
33. E. Cheng M.-J. Lipman H. Park 2001 Super connectivity of star graphs, alternating group graphs and split-stars Ars Combinatoria 59 107 116
34. W. K. Chiang R. J. Chen 1995 The (n, k)-star graphs: A generalized star graph Information Processing Letters 56 259 264
35. W. K. Chiang R. J. Chen 1998 On the arrangement graph Information Processing Letters 66 215 219
36. Choudum S A, Sunitha V. Wide-diameter of augmented cubes. Technical Report. Department of Mathematics, Indian Institute of Technology Madras, Chennai, November 2000
37. Choudum S A, Sunitha V. Automorphisms of augmented cubes. Technical Report. Department of Mathematics, Indian Institute of Technology Madras, Chennai, March 2001
38. S. A. Choudum V. Sunitha 2002 Augmented cubes Networks 40 2 71 84
39. P. Cull S. M. Larson 1995 The Möbius cubes IEEE Transactions on Computers 44 5 647 659
40. P. Cull S. M. Larson 1995 On generalized twisted cubes Information Processing Letters 55 53 55
41. K. Day A. Tripathi 1992 Arrangement graphs: A class of generalized star graphs Information Processing Letters 42 5 235 241
42. K. Day A. Tripathi 1993 Embedding of cycles in arrangement graphs IEEE Transactions on Computers 42 8 1002 1006
43. Z.-Z. Du J. Jing M.-J. Ma J.-M. Xu 2008 Cycle embedding in hypercubes with faulty vertices and edges Journal of University of Science and Technology of China 38 9 1020 1023
44. K. Efe 1991 A variation on the hypercube with lower diameter IEEE Transactions on Computers 40 11 1312 1316
45. A. El-Amawy S. Latifi 1991 Properties and performance of folded hypercubes IEEE Transactions on Parallel and Distributed Systems 2 3 31 42
46. A. H. Esfahanian 1989 Generalized measures of fault tolerance with application to n-cube networks IEEE Transactions on Computers 38 11 1586 1591
47. J. Fan 2002 Hamilton-connectivity and cycle-embedding of the Möbius cubes Information Processing Letters 82 113 117
48. J. Fan X. Jia X. Lin 2006 Complete path embeddings in crossed cubes Information Sciences 176 22 3332 3346
49. J. Fan X. Lin X. Jia 2005 Node-pancyclicity and edge-pancyclicity of crossed cubes Information Processing Letters 93 3 133 138
50. J. Fan X. Lin X. Jia 2005 Optimal path embedding in crossed cubes IEEE Transactions on Parallel and Distributed Systems 16 12 1190 1200
51. J. Fan X. Lin X. Jia 2007 Optimal fault-tolerant embedding of paths in twisted cubes Journal of Parallel and Distributed Computing 67 2 205 214
52. J. Fan X. Lin X. Jia R. W. H. Lau 2005 Edge-pancyclicity of twisted cubes Lecture Notes in Computer Science 3827 1090 1099
53. J.-S. Fu 2003 Fault-tolerant cycle embedding in the hypercube Parallel Computing 29 821 832
54. J.-S. Fu 2006 Longest fault-free paths in hypercubes with vertex faults Information Sciences 176 759 771
55. J.-S. Fu 2007 Conditional fault-tolerant hamiltonicity of star graphs Parallel Computing 33 488 496
56. J.-S. Fu 2008 Fault-free cycles in folded hypercubes with more faulty elements Information Processing Letters 108 5 261 263
57. J.-S. Fu 2008 Fault-free hamiltonian cycles in twisted cubes with conditional link faults Theoretical Computer Science 407 1-3 318 329
58. A. Germa M. C. Heydemann D. Sotteau 1998 Cycles in the cube-connected cycles graphs Discrete Applied Mathematics 83 135 155
59. F. Harary J. P. Hayes H. J. Wu 1988 A survey of the theory of hypercube graphs Computers and Mathematics with Applications 15 4 277 289
60. F. Harary M. Lewinter 1987 Hypercubes and other recursively defined Hamilton laceable graphs Congressus Numerantium 60 81 84
61. M. H. Heydari I. H. Sudborough 1997 On the diameter of the pancake network Journal of Algorithms 25 67 94
62. P. A. J. Hilbers M. R. J. Koopman J. L. A. van de Snepscheut 1987 The twisted cubes Lecture Notes in Computer Science 258-259 152 159
63. A. Hobbs 1976 The square of a block is vertex pancyclic Journal of Combinatorical Theory, B 20 1 1 4
64. S.-Y. Hsieh 2005 Embedding longest fault-free paths onto star graphs with more vertex faults Theoretical Computer Science 337 1-3 370 378
65. S.-Y. Hsieh 2006 Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges Parallel Computing 32 1 84 91
66. S.-Y. Hsieh 2008 Some edge-fault-tolerant properties of the folded hypercube Networks 52 2 92 101
67. S.-Y. Hsieh 2008 A note on cycle embedding in folded hypercubes with faulty elements Information Processing Letters 108 2 81
68. S.-Y. Hsieh N.-W. Chang 2006 Hamiltonian path embedding and pancyclicity on the Möbius cube with faulty nodes and faulty edges IEEE Transactions on Computers 55 7 854 863
69. S.-Y. Hsieh C.-H. Chen 2004 Pancyclicity on Möbius cubes with maximal edge faults Parallel Computing 30 3 407 421
70. S.-Y. Hsieh G.-H. Chen C.-W. Ho 1999 Fault-free hamiltonian cycles in faulty arrangement graphs IEEE Trans Parallel and Distributed Systems 10 3 223 237
71. S.-Y. Hsieh G.-H. Chen C.-W. Ho 2000 Hamiltonian-laceability of star graphs Networks 36 4 225 232
72. S.-Y. Hsieh G.-H. Chen C.-W. Ho 2001 Longest fault-free paths in star graphs with vertex faults Theoretical Computer Science 262 215 227
73. S.-Y. Hsieh G.-H. Chen C.-W. Ho 2001 Longest fault-free paths in star graphs with edge faults IEEE Transactions on Computers 50 9 960 971
74. S.-Y. Hsieh C.-N. Kuo 2005 1-vertex-Hamiltonian-laceability of hypercubes with maximal edge faults Journal of Interconnection Networks 6 4 407 415
75. S.-Y. Hsieh C.-N. Kuo 2007 Hamilton-connectivity and strongly Hamiltonian-laceability of folded hypercubes Computers and Mathematics with Applications 53 7 1040 1044
76. Hsieh S-Y, Lee C-W. Conditional edge-fault hamiltonicity of matching composition networks. IEEE Transactions on Parallel and Distributed Systems, DOI: 10.1109/TPDS.2008.123
77. Hsieh S-Y, Lin T J. Embedding cycles and paths in a k-ary n-cube. In: Proceedings of the 13th International Conference on Parallel and Distributed Systems (ICPADS). IEEE Computer Society, 2007, 1-7
78. Hsieh S-Y, Lin T-J. Panconnectivity and edge-pancyclicity of k-ary n-cubes. Networks, DOI: 10.1002/net.20290
79. S.-Y. Hsieh T. J. Lin H. L. Huang 2007 Panconnectivity and edge-pancyclicity of 3-ary n-cubes Journal of Supercomputing 42 225 233
80. S.-Y. Hsieh T.-H. Shen 2008 Edge-bipancyclicity of a hypercube with faulty vertices and edges Discrete Applied Mathematics 156 10 1802 1808
81. S.-Y. Hsieh J.-Y. Shiu 2007 Cycle embedding of augmented cubes Applied Mathematics and Computation 191 314 319
82. Hsieh S-Y, Wu C-D. Optimal fault-tolerant hamiltonicity of star graphs with conditional edge faults. Journal of Supercomputing, DOI: 10.1007/s11227-008-0242-9
83. H.-C. Hsu L.-C. Chiang J. J. M. Tan L.-H. Hsu 2005 Fault hamiltonicity of augmented cubes Parallel Computing 31 1 131 145
84. H.-C. Hsu Y.-L. Hsieh J. J. M. Tan L.-H. Hsu 2003 Fault hamiltonicity and fault hamiltonian connectivity of the (n, k)-star graphs Networks 42 4 189 201
85. H.-C. Hsu T.-K. Li J. J. M. Tan L.-H. Hsu 2004 Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs IEEE Transactions on Computers 53 1 39 52
86. K.-S. Hu S.-S. Yeoh C.-Y. Chen L.-H. Hsu 2007 Node-pancyclicity and edge-pancyclicity of hypercube variants Information Processing Letters 102 1 1 7
87. J. Huang J.-M. Xu 2005 Multiply-twisted hypercube with four or less dimensions is vertex-transitive Chinese Quarterly Journal of Mathematics 20 4 430 434
88. K. Huang J. Wu 1995 Area efficient layout of balanced hypercubes Int'1 J High Speed Electronics and Systems 6 4 631 646
89. S.-C. Huang C.-H. Chen 2000 Cycles in butterfly graphs Networks 35 1 11
90. Huang W-T, Chen W-K, Chen C-H. Pancyclicity of Möbius cubes. In: Proceedings of the Ninth international Conference on Parallel and Distributed Systems (ICPADS'02) on 17-20 Dec 2002. 591-596
91. W. T. Huang Y. C. Chuang J. J. M. Tan L. H. Hsu 2000 Fault-free Hamiltonian cycle in faulty Möbius cubes Computación y Systemas 4 2 106 114
92. W. T. Huang Y. C. Chuang J. J. M. Tan L. H. Hsu 2002 On the fault-tolerant hamiltonicity of faulty crosses cubes IEICE Trans on Fundamentals E85-A 6 1359 1370
93. W. T. Huang J. J. M. Tan C. N. Huang L. H. Hsu 2002 Fault-tolerant hamiltonicity of twisted cubes J Parallel and Distributed Computing 62 591 604
94. C.-N. Hung H.-C. Hsu K.-Y. Liang L.-H. Hsu 2003 Ring embedding in faulty pancake graphs Information Processing Letters 86 271 275
95. H.-S. Hung J.-S. Fu G.-H. Chen 2007 Fault-free Hamiltonian cycles in crossed cubes with conditional link faults Information Sciences 177 24 5664 5674
96. J. Jing Z.-Z. Du M.-J. Ma J.-M. Xu 2008 Edge-fault-tolerant bipanconnectivity of hypercubes Journal of University of Science and Technology of China 38 9 1017 1019
97. J. S. Jwo S. Lakshmivarahan S. K. Dhall 1991 Embedding of cycles and grids in star graphs J Circuits Syst Computers 1 43 74
98. J. S. Jwo S. Lakshmivarahan S. K. Dhall 1993 A new class of interconnection networks based on the alternating group Networks 33 315 326
99. A. Kanevsky C. Feng 1995 On the embedding of cycles in pancake graphs Parallel Computing 21 923 936
100. Y. Kikuchi T. Araki 2006 Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs Information Processing Letters 100 2 52 59
101. Kim H-C, Park J-H. Fault hamiltonicity of two-dimensional torus networks. In: Proceedings of the Workshop on Algorithms and Computation WAAC'00, Tokyo, Japan. 2000, 110-117
102. T.-L. Kueng T. Liang L.-H. Hsu J. J. M. Tan 2009 Long paths in hypercubes with conditional node-faults Information Sciences 179 5 667 681
103. P. Kulasinghe S. Bettayeb 1995 Multiply-twisted hypercube with five of more dimensions is not vertex-transitive Information Processing Letters 53 33 36
104. Latifi S, Zheng S, Bagherzadeh N. Optimal ring embedding in hypercubes with faulty links. In: Proc Fault-Tolerant Computing Symp. 1992, 178-184
105. Leighton F T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo: Morgan Kaufman, 1992
106. M. Lewinter W. Widulski 1997 Hyper-Hamilton laceable and caterpillar-spannable product graphs Computers and Mathematics with Applications 34 1 99 104
107. Y.-R. Leu S. Y. Kuo 1999 Distributed fault-tolerant ring embedding and reconfiguration in hypercubes IEEE Transactions on Computers 48 1 81 88
108. T.-K. Li 2005 Cycle embedding in star graphs with edge faults Applied Mathematics and Computation 167 2 891 900
109. T.-K. Li J. J. M. Tan L.-H. Hsu 2004 Hyper hamiltonian laceability on edge fault star graph Information Sciences 165 1-2 59 71
110. T. K. Li C. H. Tsai J. J. M. Tan L. H. Hsu 2003 Bipannectivity and edge-fault-tolerant bipancyclicity of hypercubes Information Processing Letters 87 2 107 110
111. C.-K. Lin H.-M. Huang L.-H. Hsu 2005 The super connectivity of the pancake graphs and the super laceability of the star graphs Theoretical Computer Science 339 2-3 257 271
112. R. S. Lo G. H. Chen 2001 Embedding hamiltonian path in faulty arrangement graphs with the backtracking method IEEE Trans Parallel and Distributed Systems 12 2 209 222
113. M.-J. Ma G.-Z. Liu X.-F. Pan 2007 Path embedding in faulty hypercubes Applied Mathematics and Computation 192 1 233 238
114. M.-J. Ma G.-Z. Liu J.-M. Xu 2007 Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes Parallel Computing 33 1 36 42
115. M.-J. Ma G.-Z. Liu J.-M. Xu 2008 Fault-tolerant embedding of paths in crossed cubes Theoretical Computer Science 407 1-3 110 116
116. M.-J. Ma J.-M. Xu 2005 Edge-pancyclicity of crossed cubes Journal of University of Science and Technology of China 35 3 329 333
117. M.-J. Ma J.-M. Xu 2006 Panconnectivity of locally twisted cubes Applied Mathematics Letters 19 7 681 685
118. M.-J. Ma J.-M. Xu 2008 Weak edge-pancyclicity of locally twisted cubes Ars Combinatoria 89 89 94
119. Ma M-J, Xu J-M. Transitivity and panconnectivity of folded hypercubes. Ars Combinatoria (to appear)
120. M.-J. Ma J.-M. Xu Z.-Z. Du 2006 Edge-fault-tolerant hamiltonicity of folded hypercubes Journal of University of Science and Technology of China 36 3 244 248
121. Mitchem J, Schmeichel E. Pancyclic and bipancyclic graphs-a survey. In: Proc First Colorado Symp on Graphs and Applications, Boulder, CO, 1982. New York: Wiley-Interscience, 1985, 271-278
122. O. Ore 1963 Hamilton connected graphs Journal de Mathématiques Pures et Appliquées 42 9 21 27
123. C. D. Park K. Y. Chwa 2004 Hamiltonian properties on the class of hypercube-like networks Information Processing Letters 91 1 11 17
124. J.-H. Park K.-Y. Chwa 2000 Recursive circulants and their embeddings among hypercubes Theoretical Computer Science 244 35 62
125. J. H. Park H. C. Kim H. S. Lim 2007 Panconnectivity and pancyclicity of hypercube-like interconnection networks with fault elements Theoretical Computer Science 377 1-3 170 180
126. Provost F J, Melhem R. Distributed fault tolerant embedding of binary tree and rings in hypercubes. In: Proc Internat Workshop on Defect and Fault Tolerance in VLSI Systems. 1988, 831-838
127. Y. Saad M. H. Schultz 1988 Topological properties of hypercubes IEEE Transactions on Computers 37 7 867 872
128. Sen A, Sengupta A, Bandyopadhyay S. On some topological properties of hypercube, incomplete hypercube and supercube. In: Proceedings of the International Parallel Processing Symposium, Newport Beach, April, 1993. 636-642
129. A. Sengupta 1998 On ring in hypercubes with faulty nodes and links Information Processing Letters 68 207 214
130. L.-M. Shih J. J. M. Tan L.-H. Hsu 2007 Edge-bipancyclicity of conditional faulty hypercubes Information Processing Letters 105 1 20 25
131. G. Simmons 1978 Almost all n-dimensional rectangular lattices are Hamilton laceable Congressus Numerantium 21 103 108
132. I. A. Stewart Y. Xiang 2009 Bipanconnectivity and bipancyclicity in k-ary n-cubes IEEE Transactions on Parallel and Distributed Systems 20 1 25 33
133. C.-M. Sun C.-N. Hung H.-M. Huang L.-H. Hsu Y.-D. Jou 2007 Hamiltonian laceability of faulty hypercubes Journal of Interconnection Networks 8 2 133 145
134. M. Tchuente 1982 Generation of permutations by graphical exchanges Ars Combinatoria 14 115 122
135. Y.-H. Teng J. J. M. Tan L.-H. Hsu 2008 Panpositionable hamiltonicity and panconnectivity of the arrangement graphs Applied Mathematics and Computation 198 1 414 432
136. C. H. Tsai 2004 Linear array and ring embeddings in conditional faulty hypercubes Theoretical Computer Science 314 3 431 443
137. C.-H. Tsai 2008 Embedding various even cycles in the hypercube with mixed link and node failures Applied Mathematics Letters 21 8 855 860
138. C.-H. Tsai S.-Y. Jiang 2007 Path bipancyclicity of hypercubes Information Processing Letters 101 3 93 97
139. C.-H. Tsai Y.-C. Lai 2007 Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes Information Sciences 177 24 5590 5597
140. C. H. Tsai T. Liang L.-H. Hsu M.-Y. Lin 2003 Cycle embedding a faulty wrapped butterfly graphs Networks 42 2 85 96
141. C.-H. Tsai J.-M. Tan T. Liang L.-H. Hsu 2002 Fault-tolerant Hamiltonian laceability of hypercubes Information Processing Letters 83 6 301 306
142. Tsai P-Y, Chen G-H, Fu J-S. Edge-fault-tolerant pancyclicity of alternating group graphs. Networks, DOI: 10.1002/net.20291
143. P.-Y. Tsai J.-S. Fu G.-H. Chen 2008 Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model Theoretical Computer Science 409 3 450 460
144. P.-Y. Tsai J.-S. Fu G.-H. Chen 2009 Fault-free longest paths in star networks with conditional link faults Theoretical Computer Science 410 8-10 766 775
145. Y.-C. Tseng 1996 Embedding a ring in a hypercube with both faulty links and faulty nodes Information Processing Letters 59 217 222
146. Y. C. Tseng S. H. Chang J. P. Sheu 1997 Fault-tolerant ring embedding in a star graph with both link and node failures IEEE Trans Parallel and Distributed Systems 8 12 1185 1195
147. Wang D, An T, Pan M, Wang K, Qu S. Hamiltonianlike properties of k-ary n-cubes. In: Proceedings of Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT05), 2005. 1002-1007
148. D.-J. Wang 2001 Embedding hamiltonian cycles into folded hypercubes with faulty links Journal of Parallel and Distributed Computing 61 545 564
149. H.-L. Wang J.-W. Wang J.-M. Xu 2009 Edge-fault-tolerant bipanconnectivity of hypercubes Information Science 179 4 404 409
150. W.-W. Wang M.-J. Ma J.-M. Xu 2007 Fault-tolerant pancyclicity of augmented cubes Information Processing Letters 103 2 52 56
151. J. E. Williamson 1977 Panconnected graphs II Periodica Mathematica Hungarica 8 2 105 116
152. J. Wu K. Huang 1997 The balanced hypercubes: A cube-based system for fault-tolerant applications IEEE Transactions on Computers 46 4 484 490
153. Xu J-M. Topological Structure and Analysis of Interconnection Networks. Dordrecht/Boston/London: Kluwer Academic Publishers, 2001
154. J.-M. Xu Z.-Z. Du M. Xu 2005 Edge-fault-tolerant edge-bipancyclicity of hypercubes Information Processing Letters 96 4 146 150
155. J.-M. Xu M.-J. Ma 2006 Cycles in folded hypercubes Applied Mathematics Letters 19 2 140 145
156. J.-M. Xu M.-J. Ma M. Lu 2006 Paths in Möbius cubes and crossed cubes Information Processing Letters 97 3 94 97
157. J.-M. Xu M.-J. Ma Z.-Z. Du 2006 Edge-fault-tolerant properties of hypercubes and folded hypercubes Australasian Journal of Combinatorics 35 7 16
158. M. Xu X.-D. Hu J.-M. Xu 2007 Edge-pancyclicity and hamiltonian laceability of balanced hypercubes Applied Mathematics and Computation 189 2 1393 1401
159. M. Xu X.-D. Hu Q. Zhu 2006 Edge-bipancyclicity of star graphs under edge-fault tolerant Applied Mathematics and Computation 183 2 972 979
160. M. Xu J.-M. Xu 2005 Edge-pancyclicity of Möbius cubes Information Processing Letters 96 4 136 140
161. M.-C. Yang T.-K. Li J. J. M. Tan L.-H. Hsu 2003 Fault-tolerant cycle-embedding of crossed cubes Information Processing Letters 88 4 149 154
162. M.-C. Yang T.-K. Li J. J. M. Tan L.-H. Hsu 2006 On embedding cycles into faulty twisted cubes Information Sciences 176 6 676 690
163. M.-C. Yang J. J. M. Tan L.-H. Hsu 2007 Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes Journal of Parallel and Distributed Computing 67 4 362 368
164. P. J. Yang S. B. Tien C. S. Raghavendra 1994 Embedding of rings and meshes onto faulty hypercubes using free dimensions IEEE Transactions on Computers 43 5 608 613
165. X. F. Yang D. J. Evans G. M. Megson 2005 The locally twisted cubes International Journal of Computer Mathematics 82 4 401 413
166. X. F. Yang D. J. Evans G. M. Megson Y. Y. Tang 2005 On the path-connectivity, vertexpancyclicity, and edge-pancyclicity of crossed cubes Neural, Parallel and Scientific Computations 13 1 107 118
167. X. F. Yang G. M. Megson D. J. Evans 2004 Locally twisted cubes are 4-pancyclic Applied Mathematics Letters 17 919 925
168. X. F. Yang G. M. Megson D. J. Evans 2006 Pancyclicity of Möbius cubes with faulty nodes Microprocessors and Microsystems 30 3 165 172