Conditional Edge-Fault Hamiltonicity of Cartesian Product Graph
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 97 === A graph G is called conditional k-edge-fault Hamiltonian if after deleting at most k edges from G and each vertex is incident to at least two fault-free edges, the resulting graph remains Hamiltonian. Given two graph G and H, let k1 and k2 be the positive inte...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/08366465385493194785 |