Node-pancyclicity of twisted cubes
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 94 === A graph G = (V,E) is said to be pancyclic if it contains cycles of all lengths from 4 to V in G. Now, we are interesting in node-pancyclic problem. We say that a graph G is node-pancyclic if for every node u, G contains cycles C of all lengths such that u is i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/54143561387808314197 |
| Summary: | 碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 94 === A graph G = (V,E) is said to be pancyclic if it contains cycles of all lengths from 4 to V in G. Now, we are interesting in node-pancyclic problem. We say that a graph G is node-pancyclic if for every node u, G contains cycles C of all lengths such that u is in C. The twisted cube is an alternative to the popular hypercube network. In this paper, we prove that the twisted cube is node-pancyclic.
|
|---|