Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 陳玉專 | en_US |
dc.contributor.author | Y-Chuang Chen | en_US |
dc.contributor.author | 徐力行 | en_US |
dc.contributor.author | Lih-Hsing Hsu | en_US |
dc.date.accessioned | 2014-12-12T02:22:57Z | - |
dc.date.available | 2014-12-12T02:22:57Z | - |
dc.date.issued | 1999 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#NT880394025 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/65519 | - |
dc.description.abstract | 給定一個k-正則圖G,當k是偶數的時候,其邊集合可以被分解成k/2個漢彌爾頓迴圈,或當k是奇數的時候,其邊集合可以被分解成(k-1)/2個漢彌爾頓迴圈,則我們說圖G是可被漢彌爾頓分解的。在這篇論文中,我們證明了每一個遞迴環繞圖都是可以被漢彌爾頓分解的。 | zh_TW |
dc.description.abstract | A k-regular graph G is hamiltonian decomposable if its edge-set can be partitioned into k/2 hamiltonian cycles when k is even or (k-1)/2 hamiltonian cycles and a perfect matching when k is odd. In this paper, we prove that every recursive circulant graph is hamiltonian decomposable. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | 遞迴環繞圖 | zh_TW |
dc.subject | 漢彌爾頓分解 | zh_TW |
dc.subject | recursive circulant graph | en_US |
dc.subject | hamiltonian decomposition | en_US |
dc.title | 對遞迴環繞圖的漢彌爾頓分解 | zh_TW |
dc.title | Hamiltonian Decompositions of Recursive Circulant Graphs | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
Appears in Collections: | Thesis |