標題: 最佳容錯漢米爾頓及漢米爾頓連接圖
Optimal Fault-Tolerant Hamiltonian and Hamiltonian Connected Graphs
作者: 黃詠仁
Yong-Zen Huang
徐力行
Lih-Hsing Hsu
資訊科學與工程研究所
關鍵字: k連接;遞迴式循環圖;最佳容錯;k-漢米爾頓;k-漢米爾頓連接;k-regular;recursive circulant graphs;optimal fault-tolerant;k-hamiltonian;k-hamiltonian connected
公開日期: 2001
摘要: 當一個k連接漢米爾頓及和米爾頓連接圖損壞k-2及k-3個節點或邊時仍是漢米爾頓及漢米爾頓連接時, 此圖稱為最佳容錯漢米爾頓及漢米爾頓連接圖. 在這篇文章中我們提出一種新的建構方法來建構最佳漢米爾頓及漢米爾頓連接圖.
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.
URI: http://140.113.39.130/cdrfb3/record/nctu/#NT900394009
http://hdl.handle.net/11536/68531
顯示於類別:畢業論文