On Edge Fault-Tolerant Hamiltonian Graph
碩士 === 輔仁大學 === 數學系 === 83 === A graph is called k-edge fault-tolerant Hamiltonian (or k-EFH in short) if when any k edges are removed, the remaining graph still is Hamiltonian. Among all k-EFH graphs with n vertices, those having th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/14123344190198704721 |