Fault-Free Hamiltonian Cycles Passing through Prescribed Edges in $k$ -Ary $n$-Cubes with Faulty Edges

The k-ary n-cube Q
_n
^k
n is one of the most attractive interconnection networks for parallel and distributed systems. In this paper, we consider the problem of a fault-free hamiltonian cycle passing through prescribed edges in a k-ary n-cube Q
_n
^k
with some faulty edges. The following result is obtained: For any n ≥ 2 and k ≥ 3, let F ⊂ E(Q
_n
^k
), P ⊂ E(Q
_n
^k
) \ F with |P|≤ 2n - 2, |F| ≤ 2n - (|P| + 2). Then there exists a hamiltonian cycle passing through all edges of P in Q
_n
^k
- F if and only if the subgraph induced by P consists of pairwise vertex-disjoint paths. It improves the result given by Yang and Wang [34].