Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges

TL;DR

This paper investigates the fault-tolerance of balanced hypercubes, demonstrating the existence of long fault-free cycles despite the presence of both faulty vertices and edges, extending previous results focused on single fault types.

Contribution

It establishes the existence of long fault-free cycles in balanced hypercubes with both faulty vertices and edges, under combined fault constraints, which was not previously addressed.

Findings

Existence of a fault-free cycle of length $2^{2n}-2|F_v|$ in $BH_n$ with combined faults

Fault-tolerance results for balanced hypercubes with both vertex and edge faults

Cycle length is optimal in the worst-case scenario due to bipartite structure

Abstract

Let $F_{v}$ (resp. $F_e$) be the set of faulty vertices (resp. faulty edges) in the $n$-dimensional balanced hypercube $BH_n$. Fault-tolerant Hamiltonian laceability in $BH_n$ with at most $2n-2$ faulty edges is obtained in [Inform. Sci. 300 (2015) 20--27]. The existence of edge-Hamiltonian cycles in $BH_n-F_e$ for $|F_e|\leq 2n-2$ are gotten in [Appl. Math. Comput. 244 (2014) 447--456]. Up to now, almost all results about fault-tolerance in $BH_n$ with only faulty vertices or only faulty edges. In this paper, we consider fault-tolerant cycle embedding of $BH_n$ with both faulty vertices and faulty edges, and prove that there exists a fault-free cycle of length $2^{2n}-2|F_v|$ in $BH_n$ with $|F_v|+|F_e|\leq 2n-2$ and $|F_v|\leq n-1$ for $n\geq 2$. Since $BH_n$ is a bipartite graph with two partite sets of equal size, the cycle of a length $2^{2n}-2|F_v|$ is the longest in the worst-case.