Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes

Authors:
Sun-Yuan Hsieh;Che-Nan Kuo
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 11
Cited 5

The Twisted N-Cube with Application to Multiprocessing

IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computation: models and methods

Parallel computation: models and methods
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Embedding Hamiltonian cycles into folded hypercubes with faulty links

Journal of Parallel and Distributed Computing
Fault-tolerant hamiltonian laceability of hypercubes

Information Processing Letters
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks

Journal of Parallel and Distributed Computing
Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model

Journal of Systems Architecture: the EUROMICRO Journal
Generalized Hypercube and Hyperbus Structures for a Computer Network

IEEE Transactions on Computers
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Fault-free cycles in folded hypercubes with more faulty elements

Information Processing Letters
Fault-Free Cycles in Conditional Faulty Folded Hypercubes

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes

Information Sciences: an International Journal
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs

Mathematical and Computer Modelling: An International Journal
Cycles embedding on folded hypercubes with faulty nodes

Discrete Applied Mathematics

Quantified Score

Hi-index	0.09

Visualization

Abstract

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.