Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks

References

• Bondy , J. A. and Murty , U. S.R. 1980 . “ Graph Theory with Applications ” . North Holland, New York
   Google Scholar
• Chen , Y. C. 2004 . On some super fault-tolerant hamiltonian graphs . Appl. Math. Comput , 148 : 729 – 741 .
   Web of Science ®Google Scholar
• Chen , Y. C. 2006 . A recursively construction scheme for super fault tolerant hamiltonian graphs . Appl. Math. Comput , 177 : 465 – 481 .
   Google Scholar
• Das , S. K. , Öhring , S. and Banejee , A. K. Embeddings into hyper Petersen networks: yet another hypercube-like interconnection topology J. VLSl Design . Proceedings of the 4th Symposium Frontiers of Massively Parallel Computation (Frontiers 92) . October 1992 , McLean, VA. Vol. 2 , pp. 335 – 351 . special issue on interconnection networks. pp. 270–277
   Google Scholar
• Hsieh , S. Y. , Chen , G. H. and Ho , C. W. 1999 . Fault-free hamiltonian cycles in faulty arrangement graphs . IEEE Trans. Parallel Distrib. Syst , 10 : 223 – 237 .
   Web of Science ®Google Scholar
• Hsu , H. C. 2005 . Fault hamiltonicity of augmented cubes . Parallel Comput , 31 : 131 – 145 .
   Web of Science ®Google Scholar
• Hsu , H. C. 2003 . Fault hamiltonicity and fault hamiltonian connectivity of the (n, k)-star graphs . Networks , 42 : 189 – 201 .
   Google Scholar
• Hsu , H. C. 2004 . Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs . IEEE Trans. Comput , 53 : 39 – 53 .
   Google Scholar
• Huang , W. T. 2000 . Fault-free hamiltonian cycle in faulty möbius cubes . J. Comput. Syst , 4 : 106 – 114 .
   Google Scholar
• Huang , W. T. 2002 . On the fault tolerant hamiltonicity of crossed cubes . IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E85-A , : 1359 – 1370 .
   Google Scholar
• Huang , W. T. 2002 . Fault tolerant hamiltonicity of twisted cubes . J. Parallel Distrib. Comput , 62 : 591 – 604 .
   Web of Science ®Google Scholar
• Hung , C. N. 2003 . Ring embedding in faulty pancake graphs . Inform. Process. Lett , 86 : 271 – 275 .
   Web of Science ®Google Scholar
• Leighton , F. T. 1992 . “ Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes ” . San Mateo, CA : Morgan Kaufmann .
   Google Scholar
• Monien , B. and Sudborough , H. 1990 . “ Embedding one interconnection network in another ” . In Computat. Graph Theory , 257 – 282 . Springer-Verlag, Wien .
   Google Scholar
• Öhring , S. R. and Das , S. K. 1996 . Folded Petersen cube networks: new competitors for the hypercubes . IEEE Trans. Parallel Distrib. Syst , 7 : 151 – 168 .
   Web of Science ®Google Scholar
• Öhring , S. R. On Generalized Fat Trees . Proceedings of the 9th lnt'l Parallel Processing Symposium . Santa Barbara, CA. pp. 37 – 44 .
   Google Scholar
• Preparata , F. P. and Vuillemin , J. 1981 . The cube-connected cycles: a versatile network for parallel computation . Comm. ACM , 24 : 300 – 309 .
   Web of Science ®Google Scholar
• Saad , Y. and Schulta , M. H. 1988 . Topological properties of hypercubes . IEEE Trans. Comput , 37 : 867 – 872 .
   Web of Science ®Google Scholar
• Samatham , M. R. and Pradhan , D. K. 1989 . The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI . IEEE Trans. Comput , 38 : 567 – 581 .
   Web of Science ®Google Scholar
• Saxena , P. C. , Gupta , S. and Rai , J. 2003 . A delay optimal coterie on the k-dimensional folded Petersen graph . J. Parallel Distrib. Comput , 63 : 1026 – 1035 .
   Google Scholar
• Tsai , C. H. 2002 . Hamiltonian properties of faulty recursive circulant graphs . J. Interconnect. Netw , 3 : 273 – 289 .
   Google Scholar