完整後設資料紀錄
DC 欄位語言
dc.contributor.authorKung, Tzu-Liangen_US
dc.contributor.authorLin, Cheng-Kuanen_US
dc.contributor.authorLiang, Tyneen_US
dc.contributor.authorTan, Jimmy J. M.en_US
dc.contributor.authorHsu, Lih-Hsingen_US
dc.date.accessioned2014-12-08T15:37:52Z-
dc.date.available2014-12-08T15:37:52Z-
dc.date.issued2011en_US
dc.identifier.issn0020-7160en_US
dc.identifier.urihttp://hdl.handle.net/11536/26043-
dc.identifier.urihttp://dx.doi.org/10.1080/00207161003786614en_US
dc.description.abstractThe star graph interconnection network has been recognized as an attractive alternative to the hypercube for its nice topological properties. Unlike previous research concerning the issue of embedding exactly one Hamiltonian cycle into an injured star network, this paper addresses the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty star network. To be precise, let SG(n) denote an n-dimensional star network in which f <= n - 3 edges may fail accidentally. We show that there exist (n - 2 - f)-mutually independent Hamiltonian cycles rooted at any vertex in SGn if n epsilon {3, 4}, and there exist (n - 1 - f)-mutually independent Hamiltonian cycles rooted at any vertex in SG(n) if n >= 5.en_US
dc.language.isoen_USen_US
dc.subjectHamiltonianen_US
dc.subjectinterconnection networken_US
dc.subjectstar graphen_US
dc.subjectfault toleranceen_US
dc.titleFault-free mutually independent Hamiltonian cycles of faulty star graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/00207161003786614en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF COMPUTER MATHEMATICSen_US
dc.citation.volume88en_US
dc.citation.issue4en_US
dc.citation.spage731en_US
dc.citation.epage746en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000287795600006-
dc.citation.woscount2-
顯示於類別:期刊論文


文件中的檔案:

  1. 000287795600006.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。