On embed-ding cycles into faulty twisted cubes
| dc.citation.epage | 690 | en_US |
| dc.citation.issue | 6 | en_US |
| dc.citation.spage | 676 | en_US |
| dc.citation.volume | 176 | en_US |
| dc.citation.woscount | 36 | |
| dc.contributor.author | Yang, MC | en_US |
| dc.contributor.author | Li, TK | en_US |
| dc.contributor.author | Tan, JJM | en_US |
| dc.contributor.author | Hsu, LH | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:17:03Z | |
| dc.date.available | 2014-12-08T15:17:03Z | |
| dc.date.issued | 2006-03-22 | en_US |
| dc.description.abstract | The twisted cube TQ(n) is an alternative to the popular hypercube network. Recently, some interesting properties of TQ(n) were investigated. In this paper, we study the pancycle problem on faulty twisted cubes. Let f(e) and f(v) be the numbers of faulty edges and faulty vertices in TQ(n), respectively. We show that, with f(e) + f(v) <= n - 2, a faulty TQ(n) still contains a cycle of length l for every 4 <= l < V(TQ(n)) - f(v) and odd integer n >= 3. (C) 2005 Elsevier Inc. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/j.ins.2005.04.004 | en_US |
| dc.identifier.issn | 0020-0255 | en_US |
| dc.identifier.journal | INFORMATION SCIENCES | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.ins.2005.04.004 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/12476 | |
| dc.identifier.wosnumber | WOS:000234944300005 | |
| dc.language.iso | en_US | en_US |
| dc.subject | cycle embedding | en_US |
| dc.subject | twisted cube | en_US |
| dc.subject | pancyclic | en_US |
| dc.subject | Hamiltonian | en_US |
| dc.subject | fault tolerance | en_US |
| dc.title | On embed-ding cycles into faulty twisted cubes | en_US |
| dc.type | Article | en_US |