Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 94 === A k-regular Hamiltonian and Hamiltonian connected graph is called super fault-tolerant Hamiltonian if and only if it remains Hamiltonian after removing at most k - 2 nodes and/or edges and remains Hamiltonian connected after removing at most k - 3 nodes and/...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/40949329547161452637 |
id |
ndltd-TW-094NCKU5392117 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094NCKU53921172015-12-16T04:32:12Z http://ndltd.ncl.edu.tw/handle/40949329547161452637 Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph 卡氏積圖之容錯超漢彌頓性質 Jiun-Ji Chen 陳俊吉 碩士 國立成功大學 資訊工程學系碩博士班 94 A k-regular Hamiltonian and Hamiltonian connected graph is called super fault-tolerant Hamiltonian if and only if it remains Hamiltonian after removing at most k - 2 nodes and/or edges and remains Hamiltonian connected after removing at most k - 3 nodes and/or edges. A super fault-tolerant Hamiltonian graph has a certain optimal favor with respect to the fault-tolerant Hamiltonicity and Hamiltonian connectivity. In this thesis, we investigate a method to find Hamiltonian cycles and Hamiltonian connectivity in graphs constructed by Cartesian product from any two super fault-tolerant Hamiltonian graph. Therefore, the Cartesian product of two super fault-tolerant Hamiltonian graph is also a super fault-tolerant Hamiltonian graph. Sun-Yuan Hsieh 謝孫源 2006 學位論文 ; thesis 31 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 94 === A k-regular Hamiltonian and Hamiltonian connected graph is called super fault-tolerant Hamiltonian if and only if it remains Hamiltonian after removing at most k - 2 nodes and/or edges and remains Hamiltonian connected after removing at most k - 3 nodes and/or edges. A super fault-tolerant Hamiltonian graph has a certain optimal favor with respect to the fault-tolerant Hamiltonicity and Hamiltonian connectivity. In this thesis, we investigate a method to find Hamiltonian cycles and Hamiltonian connectivity in graphs constructed by Cartesian product from any two super fault-tolerant Hamiltonian graph. Therefore, the Cartesian product of two super fault-tolerant Hamiltonian graph is also a super fault-tolerant Hamiltonian graph.
|
author2 |
Sun-Yuan Hsieh |
author_facet |
Sun-Yuan Hsieh Jiun-Ji Chen 陳俊吉 |
author |
Jiun-Ji Chen 陳俊吉 |
spellingShingle |
Jiun-Ji Chen 陳俊吉 Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph |
author_sort |
Jiun-Ji Chen |
title |
Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph |
title_short |
Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph |
title_full |
Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph |
title_fullStr |
Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph |
title_full_unstemmed |
Fault-Tolerant Super-Hamiltonicity ot the Cartesian Product Graph |
title_sort |
fault-tolerant super-hamiltonicity ot the cartesian product graph |
publishDate |
2006 |
url |
http://ndltd.ncl.edu.tw/handle/40949329547161452637 |
work_keys_str_mv |
AT jiunjichen faulttolerantsuperhamiltonicityotthecartesianproductgraph AT chénjùnjí faulttolerantsuperhamiltonicityotthecartesianproductgraph AT jiunjichen kǎshìjītúzhīróngcuòchāohànmídùnxìngzhì AT chénjùnjí kǎshìjītúzhīróngcuòchāohànmídùnxìngzhì |
_version_ |
1718149104852271104 |