Conditional Edge-Fault Hamiltonian-Connectivity of Restricted Hypercube-Like Networks
碩士 === 國立成功大學 === 資訊工程學系 === 102 === A graph G is said to be conditional k-edge-fault hamiltonian-connected if after removing k faulty edges from G, under the assumption that each node is incident to at least three fault-free edges, there exists a hamiltonian path between any two distinct nodes in t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/04370282055839537974 |