Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1709538 | Applied Mathematics Letters | 2009 | 4 Pages |
Abstract
An n-dimensional hypercube, or n-cube, denoted by Qn, is well known as bipartite and one of the most efficient networks for parallel computation. In this work, we consider the problem of cycles passing through prescribed paths in an n-dimensional hypercube with faulty edges. We obtain the following result: For nâ¥3 and 2â¤h|F|+1 and d=2h+2 otherwise. The result is optimal.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Chang-Hsiung Tsai,