Abstract
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) ∈ E(CQ_n) nd any integer l with 4 ≤ l ≤ 2^n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
