An Augmented Pancyclicity Problem of Crossed Cubes

作者：Chen Hon Chan^*; Kung Tzu Liang; Hsu Lih Hsing

来源：Computer Journal, 2018, 61(1): 54-62.

DOI：10.1093/comjnl/bxx034

• interconnection network
• crossed cube
• cycle embedding
• distance

A graph G is pancyclic if it contains a cycle C of every length with 3 <= l(C) <= |V(G)|, where l(C) denotes the length of C and V(G) denotes the number of vertices in G. In this paper, we propose an augmented pancyclicity problem for the n-dimensional crossed cube CQ(n), which is a popular variant of the hypercube network. Let dC (u, v) denote the distance between any two distinct vertices u and v traversed by a cycle C in CQn, n >= 4. Then, for any integer m with [N +1/2] +1 <= m <= 2(n-1), there exist cy

• 出版日期2018-1
• 单位中国医科大学