最佳容錯漢米爾頓及漢米爾頓連接圖

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	黃詠仁	en_US
dc.contributor.author	Yong-Zen Huang	en_US
dc.contributor.author	徐力行	en_US
dc.contributor.author	Lih-Hsing Hsu	en_US
dc.date.accessioned	2014-12-12T02:27:44Z	-
dc.date.available	2014-12-12T02:27:44Z	-
dc.date.issued	2001	en_US
dc.identifier.uri	http://140.113.39.130/cdrfb3/record/nctu/#NT900394009	en_US
dc.identifier.uri	http://hdl.handle.net/11536/68531	-
dc.description.abstract	當一個k連接漢米爾頓及和米爾頓連接圖損壞k-2及k-3個節點或邊時仍是漢米爾頓及漢米爾頓連接時, 此圖稱為最佳容錯漢米爾頓及漢米爾頓連接圖. 在這篇文章中我們提出一種新的建構方法來建構最佳漢米爾頓及漢米爾頓連接圖.	zh_TW
dc.description.abstract	A k-regular hamiltonian and hamiltonian connected graph G is optimal fault-tolerant hamiltonian and hamiltonian connected if G remains hamiltonian after removing at most k-2 nodes /or edges and remains hamiltonian connected after removing at most k-3 nodes /or edges. In this paper, we investigate a construction scheme to construct optimal fault-tolerant hamiltonian and hamiltonian connected graphs.	en_US
dc.language.iso	en_US	en_US
dc.subject	k連接	zh_TW
dc.subject	遞迴式循環圖	zh_TW
dc.subject	最佳容錯	zh_TW
dc.subject	k-漢米爾頓	zh_TW
dc.subject	k-漢米爾頓連接	zh_TW
dc.subject	k-regular	en_US
dc.subject	recursive circulant graphs	en_US
dc.subject	optimal fault-tolerant	en_US
dc.subject	k-hamiltonian	en_US
dc.subject	k-hamiltonian connected	en_US
dc.title	最佳容錯漢米爾頓及漢米爾頓連接圖	zh_TW
dc.title	Optimal Fault-Tolerant Hamiltonian and Hamiltonian Connected Graphs	en_US
dc.type	Thesis	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
顯示於類別：	畢業論文