Cycles in Cube-Connected Cycles Graphs
碩士 === 靜宜大學 === 資訊工程學系 === 102 === Let n be a positive integer with n ≥ 3. The graph CCCn has n×2^n vertices, labeled (l, x), where 0 ≤ l ≤ n − 1 and x is an n-bit binary string. Two vertices (l, x) and (l',y) are adjacent if and only if either x = y and |l - l'| = 1, or l = l' and y...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29992653110515468018 |