完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | 鄭斐文 | en_US |
dc.contributor.author | Fei-Wen Cheng | en_US |
dc.contributor.author | 徐力行 | en_US |
dc.contributor.author | Lih-Hsing Hsu | en_US |
dc.date.accessioned | 2014-12-12T02:30:24Z | - |
dc.date.available | 2014-12-12T02:30:24Z | - |
dc.date.issued | 2002 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#NT910394010 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/70183 | - |
dc.description.abstract | 在這篇論文當中,我們討論遞迴式循環圖,$G(N,d)$,的泛圈容錯性質。$G(N,d)$,是由Park及Chwa在1994年提出。他們同時也證明出$G(cd^k,d)$是正則圖。我們假設$F$為在$G(cd^k,d)$裡的任意錯誤集合,其中$F\subset E(G(cd^k,d))\cup V(G(cd^k,d))$。在這篇論文中,我們證明$G(cd^k,d)-F$其中$|F|\leq deg(G(cd^k,d))-2$是弱泛圈性質當c是奇數而且$c\geq 3$。換句話說,此上限是最佳的。 | zh_TW |
dc.description.abstract | In this thesis, we consider the weakly pancyclic property on the faulty recursive circulant graph, $G(N,d)$. $G(N,d)$ was proposed in 1994 by Park and Chwa \cite{Park}. They also proved that $G(cd^k,d)$ is regular graph. Let $F$ be any faulty set in $G(cd^k,d)$ such that $F\subset E(G(cd^k,d))\cup V(G(cd^k,d))$. In this thesis, we proved that $G(cd^k,d)-F$ with $|F|\leq deg(G(cd^k,d))-2$ is weakly pancyclic where $c$ is odd, and $c\geq 3$. Moreover, this bound is tight. | en_US |
dc.language.iso | zh_TW | en_US |
dc.subject | 容錯 | zh_TW |
dc.subject | 弱泛圈性質 | zh_TW |
dc.subject | 遞迴式循環圖 | zh_TW |
dc.subject | fault-tolerant | en_US |
dc.subject | weakly pancyclic | en_US |
dc.subject | recursive circulant graph | en_US |
dc.title | 遞迴式循環圖泛圈容錯性質研究 | zh_TW |
dc.title | Fault-Tolerant Pancyclicity of Recursive Circulant Graphs | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
顯示於類別: | 畢業論文 |