Fault-tolerant cycles embedding in hypercubes with faulty edges
Consider Qn Q n with at most 3n-8 faulty edges under the following two conditions. Each vertex is incident to at least two fault-free edges. No 4-cycle has non-adjacent vertices with degrees two after removing faulty edges. Obtain that there exist fault-free cycles of every even length from 4 to 2n 2 n in Qn Q n . Improve the previous result, where a fault-free Hamiltonian cycle is constructed.
cycle embedding hypercube bipancyclic conditional faulty fault tolerance interconnection network