Abstract
The n-dimensional twisted hypercube Hn is obtained from two copies of the (n−1)-dimensional twisted hypercube Hn−1 by adding a special perfect matching between the vertices of these two copies of Hn−1. The twisted hypercube is a new variant of hypercubes with asymptotically optimal diameter introduced by X.D. Zhu. In this paper, we show that Hn has a fault-free Hamiltonian cycle if the number of faulty edges and/or vertices is no more than n−2, and it has a fault-free Hamiltonian path between any pair of non-faulty vertices if the number of faulty edges and/or vertices is no more than n−3.
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.
