扭n立方体中的边不交Hamilton圈

Edge disjoint hamiltonian cycles in twisted n-cubes

网络图的Hamilton性是图论、计算机网络理论中的重要研究议题,超立方体及其变体由于其良好的网络参数、拓扑结构吸引了众多学者的关注和研究,并将之广泛地应用于许多实际领域中.结合Lee距离Gray码理论证明了扭n立方体中存在[n/2]个边不交Hamilton圈,并且给出这些边不交Hamilton圈的生成方法.

The problem of edge-disjoint Hamiltonian cycles was widely concerned in theory and application. Based on Lee distance Gray code theory, this paper proved that there were [N/2] edge-disjoint Hamiltonian cycles in twisted n-cubes, and showed how to generate these cycles.