Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 滕元翔 | en_US |
dc.contributor.author | Yuan-Hsiang Teng | en_US |
dc.contributor.author | 徐力行 | en_US |
dc.contributor.author | Lih-Hsing Hsu | en_US |
dc.date.accessioned | 2014-12-12T02:04:27Z | - |
dc.date.available | 2014-12-12T02:04:27Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#GT009123539 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/52946 | - |
dc.description.abstract | 在這篇論文當中,我們提出一個變形的蜂巢式網路。一個矩形碟狀蜂巢式網路HReD(m,n)是由矩形蜂巢式網路HReM(m,n)加上一環邊界所得到的。一矩形碟狀蜂巢式網路HReD(m,n)是一個三正則平面圖。矩形蜂巢式網路HReM(m,n)很明顯的是一個矩形碟狀蜂巢式網路HReD(m,n)的子圖。我們也證明一矩形碟狀蜂巢式網路HReD(m,n)為漢彌爾頓。此外,若是n大於等於6,則對任何f屬於V(HReD(m,n))聯集E(HReD(m,n))來說,HReD(m,n)-f仍是漢彌爾頓。 | zh_TW |
dc.description.abstract | In this thesis, we propose a variation of honeycomb meshes. A honeycomb rectangular disk HReD(m,n) is obtained from the honeycomb rectangular mesh HReM(m,n) by adding a boundary cycle. A honeycomb rectangular disk HReD(m,n) is a 3-regular planar graph. It is obvious that the honeycomb rectangular mesh HReM(m,n) is a subgraph of HReD(m,n). We also prove that HReD(m,n) is hamiltonian. Moreover, HReD(m,n)-f remains hamiltonian for any f in V(HReD(m,n)) or E(HReD(m,n)) if n>=6. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | 漢彌爾頓 | zh_TW |
dc.subject | 蜂巢式網路 | zh_TW |
dc.subject | hamiltonian | en_US |
dc.subject | honeycomb mesh | en_US |
dc.title | 矩形碟狀蜂巢式網路 | zh_TW |
dc.title | Honeycomb Rectangular Disks | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
Appears in Collections: | Thesis |
Files in This Item:
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.