Abstract
The k-ary n-cube has been one of the most popular interconnection networks for distributed-memory parallel systems. In this paper, we study the problem of embedding cycles of various lengths into faulty k-ary n-cubes. It is proved that a faulty k-ary n-cube with fv faulty vertices and fe faulty edges admits a fault-free cycle of every even length from 4 to kn−2fv if k⩾4 is even and fv+fe⩽2n−2. Furthermore, we show that every healthy edge of the faulty k-ary n-cube lies on a fault-free cycle of every even length from 4 to kn−2fv if k⩾4 is even and fv+fe⩽2n−3. The results are optimal with respect to the number of vertex and edge faults tolerated.
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.
