通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.
作者曾提出利用王氏代数产生图的全部哈密顿圈，本文继续研究了这种算法。
In this paper the study of the algorithm which has been done by the author for generating all the Hamiltonian cycles in a graph by a method of Wang algebra is continued.
计算机科学数据库的关系中遇到了可归为倍图或补倍图的参数和哈密顿圈的问题。
In the relation of the database theory of the computer, we encounter some problems which can be translated into the problem for parameter and Hamilton cycle of double graphs or complement graphs.
若一个网络含有哈密顿圈(哈密顿路)及不同长度的圈，则可以有效模拟在环或线性阵列上设计的许多算法。
If one network contains Hamiltonian cycles (Hamiltonian paths) and cycles of variable lengths, then it can effectively simulate the algorithms designed based on rings and linear arrays.
若一个网络含有哈密顿圈(哈密顿路)及不同长度的圈，则可以有效模拟在环或线性阵列上设计的许多算法。
If one network contains Hamiltonian cycles (Hamiltonian paths) and cycles of variable lengths, then it can effectively simulate the algorithms designed based on rings and linear arrays.
应用推荐