Pancyclicity on Mobius Cubes with Maximal Edge Faults
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 92 === A graph G = (V;E) is said to be pancyclic if it contains cycles of all lengths from 4 to |V| in G. Let Fe be the set of faulty edges. In this paper, we show that an n-dimensional Mobius cube, n >= 1, contains a fault-free Hamiltonian path when |Fe| <=...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/53462742146195265531 |