On Hamiltonian cycles in Cayley graphs of wreath products
Discrete Mathematics
Group action graphs and parallel architectures
SIAM Journal on Computing
On the construction of fault-tolerant Cube-Connected Cycles networks
Journal of Parallel and Distributed Computing
The diameter of the cube-connected cycles
Information Processing Letters
Cycles in the cube-connected cycles graph
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Graph Theory and Interconnection Networks
Graph Theory and Interconnection Networks
| Hi-index | 0.04 |
Let n be a positive integer with n=3. The cube-connected cycles graph CCC"n has nx2^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=(x)^l. Let L(n) denote the set of all possible lengths of cycles in CCC"n. In this paper, we prove that L(n)={n}@?{i|i is even, 8@?i@?n+5, and i10}@?{i|n+6@?i@?n2^n} if n is odd; L(4)={4}@?{i|i is even and 8@?i@?64}; and L(n)={n}@?{i|i is even, 8@?i@?n2^n, and i10} if n is even and n=6.