On Embedding Cycles in k-Ary n-Cubes

Abstract

We completely classify when a k-ary n-cube [Formula: see text], for k ≥ 3 and n ≥ 2, contains a cycle of some given length. Our analysis yields an efficient algorithm for generating a cycle of any given length, if indeed one exists, thus answering a question posed by Bose, Broeg, Kwon and Ashir.