Abstract
In this paper, two unidirectional binary n-cubes, namely, Q1 (n) and Q2H, proposed as high-speed networking schemes by Chou and Du, are studied. We show that the smallest possible length for any maximum fault-tolerant container from a to b is at most n + 2 whether a and b are in Q1 (n) or in Q2(n). Furthermore, we prove that the wide-diameters of Q1(n) and Q2(n) are equal to n + 2. At last, we show that a conjecture proposed by Jwo and Tuan is true.
| Original language | English |
|---|---|
| Pages (from-to) | 75-87 |
| Number of pages | 13 |
| Journal | Taiwanese Journal of Mathematics |
| Volume | 6 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2002 |
| Externally published | Yes |
Keywords
- Connectivity
- Container
- Hypercube
- Wide-diameter