The minimum distance diagram of double-loop networks

Chiuyuan Chen*, F. K. Hwang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


It is well-known that the minimum distance diagram of a double-loop network yields an L-shape. It is important to know, for a given L-shape, whether there exists a double-loop network realizing it. Necessary and sufficient conditions were given before, but were said to be cumbersome. They also need some clarification. We give new conditions and a simple proof. We also prove that all double-loop networks realizing the same L-shape are isomorphic as the existing proof was given in a Spanish dissertation.

Original languageEnglish
Article number869330
Pages (from-to)977-979
Number of pages3
JournalIEEE Transactions on Computers
Issue number9
StatePublished - Sep 2000


  • Diameter
  • Double-loop network
  • L-shape
  • Sieve method

Fingerprint Dive into the research topics of 'The minimum distance diagram of double-loop networks'. Together they form a unique fingerprint.

Cite this