1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorHung, CNen_US
dc.contributor.authorHsu, HCen_US
dc.contributor.authorLiang, KYen_US
dc.contributor.authorHsu, LHen_US
dc.date.accessioned2014-12-08T15:40:46Z-
dc.date.available2014-12-08T15:40:46Z-
dc.date.issued2003-06-15en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0020-0190(02)00510-0en_US
dc.identifier.urihttp://hdl.handle.net/11536/27789-
dc.description.abstractIn this paper, we consider the fault hamiltonicity and the fault hamiltonian connectivity of the pancake graph P-n. Assume that F subset of or equal to V(P-n) boolean OR E(P-n). For n greater than or equal to 4, we prove that P-n - F is hamiltonian if F less than or equal to (n - 3) and P-n - F is hamiltonian connected if F less than or equal to (n - 4). Moreover, all the bounds are optimal. (C) 2003 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectfault toleranceen_US
dc.subjectHamiltonianen_US
dc.subjectHamiltonian connecteden_US
dc.subjectpancake graphsen_US
dc.titleRing embedding in faulty pancake graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0020-0190(02)00510-0en_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume86en_US
dc.citation.issue5en_US
dc.citation.spage271en_US
dc.citation.epage275en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000182959700007-
dc.citation.woscount14-
Appears in Collections:Articles


Files in This Item:

  1. 000182959700007.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...