Highly fault-tolerant cycle embeddings of hypercubes

Authors:
Ming-Chien Yang;Jimmy J. M. Tan;Lih-Hsing Hsu
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, 1001 Ta Hsueh Road, 300, Hsinchu 30050, Taiwan, ROC;Department of Computer and Information Science, National Chiao Tung University, 1001 Ta Hsueh Road, 300, Hsinchu 30050, Taiwan, ROC;Department of Computer Science and Information Engineering, Providence University, 43301, Taiwan, ROC
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2007

Citing 16
Cited 3

Topological Properties of Hypercubes

IEEE Transactions on Computers
On the existence of Hamiltonian circuits in faulty hypercubes

SIAM Journal on Discrete Mathematics
On the embedding of cycles in pancake graphs

Parallel Computing
Conditional fault diameter of star graph networks

Journal of Parallel and Distributed Computing
Cycles in the cube-connected cycles graph

Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
An optimal embedding of cycles into incomplete hypercubes

Information Processing Letters
Hamilton-connectivity and cycle-embedding of the Möbius cubes

Information Processing Letters
Fault-tolerant hamiltonian laceability of hypercubes

Information Processing Letters
Pancyclicity of recursive circulant graphs

Information Processing Letters
Embedding of Cycles in Arrangement Graphs

IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems

IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures

IEEE Transactions on Parallel and Distributed Systems
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes

Information Processing Letters
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs

IEEE Transactions on Computers
Fault-tolerant cycle-emebedding of crossed cubes

Information Processing Letters
Pancyclicity on Möbius cubes with maximal edge faults

Parallel Computing

Vertex-bipancyclicity of the generalized honeycomb tori

Computers & Mathematics with Applications
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The hypercube Q"n is one of the most popular networks. In this paper, we first prove that the n-dimensional hypercube is 2n-5 conditional fault-bipancyclic. That is, an injured hypercube with up to 2n-5 faulty links has a cycle of length l for every even 4=