Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Cheng-Kuanen_US
dc.contributor.authorHo, Tung-Yangen_US
dc.contributor.authorTan, Jimmy J. M.en_US
dc.contributor.authorHsu, Lih-Hsingen_US
dc.date.accessioned2014-12-08T15:10:24Z-
dc.date.available2014-12-08T15:10:24Z-
dc.date.issued2009en_US
dc.identifier.issn0020-7160en_US
dc.identifier.urihttp://hdl.handle.net/11536/7939-
dc.identifier.urihttp://dx.doi.org/10.1080/00207160701684485en_US
dc.description.abstractSome research on the folded Petersen cube networks have been published for the past several years due to its favourite properties. In this paper, we consider the fault-tolerant hamiltonicity and the fault-tolerant hamiltonian connectivity of the folded Petersen cube networks. We use FPQn, k to denote the folded Petersen cube networks of parameters n and k. In this paper, we show that FPQn, k-F remains hamiltonian for any F V(FPQn, k)E(FPQn, k) with |F|n+3k-2 and FPQn, k-F remains hamiltonian connected for any F V(FPQn, k)E(FPQn, k) with |F|n+3k-3 if (n, k){(0, 1)}{(n, 0) | n is a positive integer}. Moreover, this result is optimal.en_US
dc.language.isoen_USen_US
dc.subjecthamiltonianen_US
dc.subjecthamiltonian connecteden_US
dc.subjectfolded Petersen cube networksen_US
dc.titleFault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/00207160701684485en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF COMPUTER MATHEMATICSen_US
dc.citation.volume86en_US
dc.citation.issue1en_US
dc.citation.spage57en_US
dc.citation.epage66en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000260771800004-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

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