Abstract
The k-ary n-cube has been one of the most popular interconnection networks for massively parallel systems. In this paper, we investigate the edge-bipancyclicity of k-ary n-cubes with faulty nodes and edges. It is proved that every healthy edge of the faulty k-ary n-cube with f v faulty nodes and f e faulty edges lies in a fault-free cycle of every even length from 4 to k n − 2 f v (resp. k n − f v ) if k ⩾ 4 is even (resp. k ⩾ 3 is odd) and f v + f e ⩽ 2 n − 3. The results are optimal with respect to the number of node 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.
