Acknowledgements The author would like to thank the anonymous referees for their valuable suggestions. This work was supported by the Natural Science Foundation of Fujian Province (No. 2011J01025).
The k-ary n-cube Qkn (n ≥2 and k ≥3) is one of the most popular interconnection networks. In this paper, we consider the problem of a fault- free Hamiltonian cycle passing through a prescribed linear forest (i.e....