Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes

In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd. We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n=1 or n(>=2) is even.

[1]  Lionel M. Ni,et al.  The Twisted N-Cube with Application to Multiprocessing , 1991, IEEE Trans. Computers.

[2]  Dajin Wang.  Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links , 2001, J. Parallel Distributed Comput..

[3]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[4]  S. Lakshmivarahan,et al.  Embedding of cycles and Grids in Star Graphs , 1991, J. Circuits Syst. Comput..

[5]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[6]  Tzung-Shi Chen,et al.  A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks , 2002, J. Parallel Distributed Comput..

[7]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[8]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[9]  Jean-Claude Bermond.  Interconnection Networks , 1992 .

[10]  Gen-Huey Chen,et al.  Hamiltonian-laceability of star graphs , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[11]  Chih-Ping Chu,et al.  Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model , 2005, J. Syst. Archit..

[12]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  D. S. SzyId,et al.  Parallel Computation: Models And Methods , 1998, IEEE Concurrency.

[14]  Jimmy J. M. Tan,et al.  Fault-tolerant hamiltonian laceability of hypercubes , 2002, Inf. Process. Lett..

[15]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[16]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[17]  Yi-Ping Hung,et al.  Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model , 2009, J. Syst. Archit..

[18]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .