Embedding of Simple Cycles in Hypercubes
碩士 === 明新科技大學 === 資訊管理研究所 === 99 === The underlying topology of an interconnection network is usually modeled as a graph G = (V,E), in which V is the vertex set and E is the edge set. A graph G is pancyclic if any k-cycle can be embedded into it for 3 ≤ k ≤ |V(G)|; G is bipancyclic if any k-cycle of...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52186427205993277753 |