On some topological properties of hypercube, incomplete hypercube and supercube

Hamiltonian properties of hypercube, incomplete hypercube and supercube are examined. It is known that in a nonfaulty hypercube there are at least n! Hamiltonian cycles. The authors extend this result showing that the lower bound is at least 2/sup n-3/n! They show that with at most n-2 faulty links a faulty hypercube has at least 2(n-2)! Hamiltonian cycles. They establish that an incomplete hypercube with odd (even) number of nodes has (n-2)! Hamiltonian paths (cycles). They show that a supercube has at least (n-1)! Hamiltonian cycles and when the number of nodes is 2/sup n-1/+2/sup n-2/, then the number of Hamiltonian cycles is at least as high as 2(n-1)!.<<ETX>>

[1]  C. L. Liu.  Elements of Discrete Mathematics , 1985 .

[2]  Howard P. Katseff,et al.  Incomplete Hypercubes , 1988, IEEE Trans. Computers.

[3]  Arunabha Sen,et al.  On the Routing Problem in Faulty Supercubes , 1992, Inf. Process. Lett..

[4]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[5]  Jehoshua Bruck,et al.  Tolerating Faults in Hypercubes Using Subcube Partitioning , 1992, IEEE Trans. Computers.

[6]  Arunabha Sen,et al.  Generalized supercube: an incrementally expandable interconnection network , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[7]  Mee Yee Chan,et al.  On the Existence of Hamiltonian Circuits in Faulty Hypercubes , 1991, SIAM J. Discret. Math..

[8]  Shyan-Ming Yuan.  Topological Properties of Supercube , 1991, Inf. Process. Lett..

[9]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[10]  Robert Cypher,et al.  Fault-tolerant embeddings of rings, meshes, and tori in hypercubes , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.