Abstract
Abstract A fault-free cycle in the n-dimensional hypercube Q n with f faulty vertices is long if it has length at least 2 n − 2 f . If all faulty vertices are from the same bipartite class of Q n , such length is the best possible. We prove a conjecture of Castaneda and Gotchev [N. Castaneda and I. S. Gotchev. Embedded paths and cycles in faulty hypercubes. J. Comb. Optim., 2009. doi:10.1007/s10878-008-9205-6 .] asserting that f n = ( n 2 ) − 2 where f n for every set of at most f n faulty vertices, there exists a long fault-free cycle in Q n . Furthermore, we present several results on similar problems of long paths and long routings in faulty hypercubes and their complexity.
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.
