1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, MCen_US
dc.contributor.authorLi, TKen_US
dc.contributor.authorTan, JJMen_US
dc.contributor.authorHsu, LHen_US
dc.date.accessioned2014-12-08T15:17:03Z-
dc.date.available2014-12-08T15:17:03Z-
dc.date.issued2006-03-22en_US
dc.identifier.issn0020-0255en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.ins.2005.04.004en_US
dc.identifier.urihttp://hdl.handle.net/11536/12476-
dc.description.abstractThe 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.language.isoen_USen_US
dc.subjectcycle embeddingen_US
dc.subjecttwisted cubeen_US
dc.subjectpancyclicen_US
dc.subjectHamiltonianen_US
dc.subjectfault toleranceen_US
dc.titleOn embed-ding cycles into faulty twisted cubesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ins.2005.04.004en_US
dc.identifier.journalINFORMATION SCIENCESen_US
dc.citation.volume176en_US
dc.citation.issue6en_US
dc.citation.spage676en_US
dc.citation.epage690en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000234944300005-
dc.citation.woscount36-
Appears in Collections:Articles


Files in This Item:

  1. 000234944300005.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...