The minimum distance diagram of double-loop networks

Chiuyuan Chen*, F. K. Hwang

*此作品的通信作者

研究成果: Article同行評審

19 引文 斯高帕斯(Scopus)

摘要

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.

原文English
文章編號869330
頁(從 - 到)977-979
頁數3
期刊IEEE Transactions on Computers
49
發行號9
DOIs
出版狀態Published - 九月 2000

指紋

深入研究「The minimum distance diagram of double-loop networks」主題。共同形成了獨特的指紋。

引用此