完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Cho, HJ | en_US |
dc.contributor.author | Hsu, LY | en_US |
dc.date.accessioned | 2014-12-08T15:41:38Z | - |
dc.date.available | 2014-12-08T15:41:38Z | - |
dc.date.issued | 2002-12-16 | en_US |
dc.identifier.issn | 0020-0190 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/S0020-0190(02)00310-1 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/28310 | - |
dc.description.abstract | Assume that m and n are positive even integers with n greater than or equal to 4. The honeycomb rectangular torus HReT(m,n) is recognized as another attractive alternative to existing torus interconnection networks in parallel and distributed applications. It is known that any HReT(m, n) is a 3-regular bipartite graph. We prove that any HReT(m, n) - e is hamiltonian for any edge e is an element of E(HReT(m, n)). Moreover, any HReT(m, n) - F is hamiltonian for any F = {a, b} with a is an element of A and b is an element of B where A and B are the bipartition of HReT(m, n), if n greater than or equal to 6 or m = 2. (C) 2002 Elsevier Science B.V. All rights reserved. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | interconnection networks | en_US |
dc.subject | honeycomb torus | en_US |
dc.subject | Hamiltonian cycle | en_US |
dc.subject | ring embedding | en_US |
dc.title | Ring embedding in faulty honeycomb rectangular torus | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/S0020-0190(02)00310-1 | en_US |
dc.identifier.journal | INFORMATION PROCESSING LETTERS | en_US |
dc.citation.volume | 84 | en_US |
dc.citation.issue | 5 | en_US |
dc.citation.spage | 277 | en_US |
dc.citation.epage | 284 | en_US |
dc.contributor.department | 運輸與物流管理系 註:原交通所+運管所 | zh_TW |
dc.contributor.department | Department of Transportation and Logistics Management | en_US |
dc.identifier.wosnumber | WOS:000178849300008 | - |
dc.citation.woscount | 15 | - |
顯示於類別: | 期刊論文 |