Optimal edge fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes

TL;DR

This paper proves that balanced hypercubes are optimally fault-tolerant for Hamiltonian laceability, even with many faulty links, using induction and partitioning techniques.

Contribution

It establishes the optimal fault-tolerance level for balanced hypercubes regarding Hamiltonian laceability through a rigorous inductive proof.

Findings

Proves $BH_n$ is $(2n-2)$-fault-tolerant-prescribed Hamiltonian laceable.

Uses induction and partitioning of hypercubes for the proof.

Completes the proof for cases with at most one faulty link in the chosen dimension.

Abstract

Aims: Try to prove the $n$-dimensional balanced hypercube $BH_n$ is $(2n-2)$-fault-tolerant-prescribed hamiltonian laceability. Methods: Prove it by induction on $n$. It is known that the assertation holds for $n\in\{1,2\}$. Assume it holds for $n-1$ and prove it holds for $n$, where $n\geq 3$. If there are $2n-3$ faulty links and they are all incident with a common node, then we choose some dimension such that there is one or two faulty links and no prescribed link in this dimension; Otherwise, we choose some dimension such that the total number of faulty links and prescribed links does not exceed $1$. No matter which case, partition $BH_n$ into $4$ disjoint copies of $BH_{n-1}$ along the above chosen dimension. Results: On the basis of the above partition of $BH_n$, in this manuscript, we complete the proof for the case that there is at most one faulty link in the above chosen dimension.