论文部分内容阅读
网络图的Hamilton性是图论、计算机网络理论中的重要研究议题,超立方体及其变体由于其良好的网络参数、拓扑结构吸引了众多学者的关注和研究,并将之广泛地应用于许多实际领域中.结合Lee距离Gray码理论证明了扭n立方体中存在[n/2]个边不交Hamilton圈,并且给出这些边不交Hamilton圈的生成方法.
The Hamiltonian of network graph is an important research topic in graph theory and computer network theory. Hypercubes and their variants have attracted the attention and research of many scholars because of their good network parameters and are widely used in many In actual field, combining the Lee distance Gray code theory, we prove that there are [n / 2] -th-order non-intersecting Hamiltonian in twisted n-cubes, and give the generating method of non-intersecting Hamiltonian.