The minimum distance diagram of double-loop networks
| dc.citation.epage | 979 | en_US |
| dc.citation.issue | 9 | en_US |
| dc.citation.spage | 977 | en_US |
| dc.citation.volume | 49 | en_US |
| dc.citation.woscount | 13 | |
| dc.contributor.author | Chen, CY | en_US |
| dc.contributor.author | Hwang, FK | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:44:50Z | |
| dc.date.available | 2014-12-08T15:44:50Z | |
| dc.date.issued | 2000-09-01 | en_US |
| dc.description.abstract | It is well-known that the minimum distance diagram of st 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. | en_US |
| dc.identifier.doi | 10.1109/12.869331 | en_US |
| dc.identifier.issn | 0018-9340 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON COMPUTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/12.869331 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/30267 | |
| dc.identifier.wosnumber | WOS:000089459600012 | |
| dc.language.iso | en_US | en_US |
| dc.subject | double-loop network | en_US |
| dc.subject | L-shape | en_US |
| dc.subject | diameter | en_US |
| dc.subject | sieve method | en_US |
| dc.title | The minimum distance diagram of double-loop networks | en_US |
| dc.type | Article | en_US |