Pancyclicity on the Möbius Cube with Both Faulty Nodes and Faulty Edges
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 93 === A graph G = (V,E) is said to be pancyclic if it contains fault-free cycles of all lengths from 4 to |V| in G. Let Fv and Fe be the sets of faulty nodes and faulty edges of an n-dimensional Möbius cube MQn, respectively, and let F = Fv U Fe. In this paper, we...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/18002173535497286134 |