On container length and wide-diameter in unidirectional hypercubes

Lu Changhong, Zhang Kemin

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

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 languageEnglish
Pages (from-to)75-87
Number of pages13
JournalTaiwanese Journal of Mathematics
Volume6
Issue number1
DOIs
StatePublished - Mar 2002
Externally publishedYes

Keywords

  • Connectivity
  • Container
  • Hypercube
  • Wide-diameter

Fingerprint

Dive into the research topics of 'On container length and wide-diameter in unidirectional hypercubes'. Together they form a unique fingerprint.

Cite this