Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
428123 | Information Processing Letters | 2007 | 6 Pages |
Abstract
Xu et al. showed that for any set of faulty edges F of an n-dimensional hypercube Qn with |F|⩽n−1, each edge of Qn−F lies on a cycle of every even length from 6 to n2, n⩾4, provided not all edges in F are incident with the same vertex. In this paper, we find that under similar condition, the number of faulty edges can be much greater and the same result still holds. More precisely, we show that, for up to |F|=2n−5 faulty edges, each edge of the faulty hypercube Qn−F lies on a cycle of every even length from 6 to n2 with each vertex having at least two healthy edges adjacent to it, for n⩾3. Moreover, this result is optimal in the sense that there is a set F of 2n−4 conditional faulty edges in Qn such that Qn−F contains no hamiltonian cycle.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics