On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs
碩士 === 靜宜大學 === 資訊工程學系 === 102 === A graph is k-ordered hamiltonian if for every ordered set S of k vertices there exists a hamiltonian cycle which encounters S in its designated order. A graph is k-ordered hamiltonian connected if for every k ordered set S = {x_1, x_2, . . . , x_k} there exists a h...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/84480678632125749547 |
| id |
ndltd-TW-102PU000394002 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-102PU0003940022015-10-13T23:23:00Z http://ndltd.ncl.edu.tw/handle/84480678632125749547 On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs 在存在的可遷圖上做4-節依序的漢米爾頓和4-節依序的漢米爾頓連通立方圖 Wang, Hsuan-Wei 王璿瑋 碩士 靜宜大學 資訊工程學系 102 A graph is k-ordered hamiltonian if for every ordered set S of k vertices there exists a hamiltonian cycle which encounters S in its designated order. A graph is k-ordered hamiltonian connected if for every k ordered set S = {x_1, x_2, . . . , x_k} there exists a hamiltonian path joining x_1 to x_k that encounters S in its designated order. In this paper, we prove that the five dimensional cube-connected cycles graph, 〖CCC〗_5, is 4-ordered hamiltonian and 4-ordered hamiltonian connected graphs. This is the first non-trivial vertex transitive graph with this property. Hsu, Lih-Hsing 徐力行 2013 學位論文 ; thesis 107 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 靜宜大學 === 資訊工程學系 === 102 === A graph is k-ordered hamiltonian if for every ordered set S of k vertices there exists a hamiltonian cycle which encounters S in its designated order. A graph is k-ordered hamiltonian connected if for every k ordered set S = {x_1, x_2, . . . , x_k} there exists a hamiltonian path joining x_1 to x_k that encounters S in its designated order. In this paper, we prove that the five dimensional cube-connected cycles graph, 〖CCC〗_5, is 4-ordered hamiltonian and 4-ordered hamiltonian connected graphs. This is the first non-trivial vertex transitive graph with this property.
|
| author2 |
Hsu, Lih-Hsing |
| author_facet |
Hsu, Lih-Hsing Wang, Hsuan-Wei 王璿瑋 |
| author |
Wang, Hsuan-Wei 王璿瑋 |
| spellingShingle |
Wang, Hsuan-Wei 王璿瑋 On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs |
| author_sort |
Wang, Hsuan-Wei |
| title |
On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs |
| title_short |
On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs |
| title_full |
On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs |
| title_fullStr |
On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs |
| title_full_unstemmed |
On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs |
| title_sort |
on the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs |
| publishDate |
2013 |
| url |
http://ndltd.ncl.edu.tw/handle/84480678632125749547 |
| work_keys_str_mv |
AT wanghsuanwei ontheexistenceofvertextransitive4orderedhamiltonianand4orderedhamiltonianconnectedcubicgraphs AT wángxuánwěi ontheexistenceofvertextransitive4orderedhamiltonianand4orderedhamiltonianconnectedcubicgraphs AT wanghsuanwei zàicúnzàidekěqiāntúshàngzuò4jiéyīxùdehànmǐěrdùnhé4jiéyīxùdehànmǐěrdùnliántōnglìfāngtú AT wángxuánwěi zàicúnzàidekěqiāntúshàngzuò4jiéyīxùdehànmǐěrdùnhé4jiéyīxùdehànmǐěrdùnliántōnglìfāngtú |
| _version_ |
1718086161198481408 |