摘要

In this paper, we consider the problem of embedding a cycle containing number of nodes from 4 to 2(n) through a prescribed edge in an n-dimensional crossed cube CQ(n). The main contribution of this paper is providing a systematic O(l) algorithm to find a cycle of length l containing (u, v) in CQ(n) for any (u, v) is an element of E(CQ(n)) nd any integer l with 4 <= l <= 2(n).