Full metadata record
DC FieldValueLanguage
dc.contributor.author滕元翔en_US
dc.contributor.authorYuan-Hsiang Tengen_US
dc.contributor.author徐力行en_US
dc.contributor.authorLih-Hsing Hsuen_US
dc.date.accessioned2014-12-12T02:04:27Z-
dc.date.available2014-12-12T02:04:27Z-
dc.date.issued2003en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009123539en_US
dc.identifier.urihttp://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.abstractIn 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.isoen_USen_US
dc.subject漢彌爾頓zh_TW
dc.subject蜂巢式網路zh_TW
dc.subjecthamiltonianen_US
dc.subjecthoneycomb meshen_US
dc.title矩形碟狀蜂巢式網路zh_TW
dc.titleHoneycomb Rectangular Disksen_US
dc.typeThesisen_US
dc.contributor.department資訊科學與工程研究所zh_TW
Appears in Collections:Thesis


Files in This Item:

  1. 353901.pdf
  2. 353902.pdf
  3. 353903.pdf
  4. 353904.pdf
  5. 353905.pdf
  6. 353906.pdf

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.