Fault-free cycles in folded hypercubes with more faulty elements

Authors:
Jung-Sheng Fu
Affiliations:
Department of Electronic Engineering, National United University, Miaoli, Taiwan
Venue:
Information Processing Letters
Year:
2008

Citing 12
Cited 6

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs

IEEE Transactions on Parallel and Distributed Systems
Constructing One-to-Many Disjoint Paths in Folded Hypercubes

IEEE Transactions on Computers
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges

Parallel Computing
Strong Rabin numbers of folded hypercubes

Theoretical Computer Science
On reliability of the folded hypercubes

Information Sciences: an International Journal
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes

Computers & Mathematics with Applications
The bipanconnectivity and m-panconnectivity of the folded hypercube

Theoretical Computer Science
Some edge-fault-tolerant properties of the folded hypercube

Networks
w-Rabin numbers and strong w-Rabin numbers of folded hypercubes

Networks
A note on cycle embedding in folded hypercubes with 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
A further result on fault-free cycles in faulty folded hypercubes

Information Processing Letters
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes

Information Sciences: an International Journal
Construction of optimal independent spanning trees on folded hypercubes

Information Sciences: an International Journal
Cycles embedding on folded hypercubes with faulty nodes

Discrete Applied Mathematics
Research note: An efficient construction of one-to-many node-disjoint paths in folded hypercubes

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.90

Visualization

Abstract

Let FF"v (respectively, FF"e) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional folded hypercube FQ"n. In this paper, we show that FQ"n-FF"v-FF"e contains a fault-free cycle with length at least 2^n-2|FF"v| if |FF"e|+|FF"v|==3. Our result improves the previously known result of [S.-Y. Hsieh, A note on cycle embedding in folded hypercubes with faulty elements, Information Processing Letters (2008), in press, doi:10.1016/j.ipl.2008.04.003] where |FF"e|+|FF"v|==4.