Embedding paths into the 4-ary n-cube with faulty nodes
Shiying Wang, Jiangshan Wangmu, Zhifang Qi, Yunxia Ren · 2011
A k-ary n-cubes Qknis an important network for information transportation. In this paper, we research 4-ary n-cubes, and prove that a 4-ary n-cube with f ≤ n-1 faulty vertices admits a fault-free path of every even length from 2n to 4n-2f -2 between any two healthy vertices υ = υn-1υn-2... υ0, υ = υn-1υn-2... υ0with υj= uj± 2 (mod 4), j ϵ {0, 1, ... n-1} and υii ϵ {0, 1, ..., n-1}\{j}.