Hamiltonian cycle
- 网络哈密顿圈;哈密尔顿圈;哈密尔顿回路;哈密顿回路;汉米尔顿回圈
-
The second algorithm is designed by employing a Hamiltonian cycle existing in a honeycomb torus .
第二个全广播算法应用了蜂窝环有哈密尔顿圈这个事实。
-
The Connectivity of Directed Circulant Graphs The Hamiltonian Cycle of Cartesian Product of Directed Cycles
有向循环图的连通度有向圈卡氏积图的哈密尔顿圈
-
The Problem of Hamiltonian Cycle on Hamilton Group
Hamilton群上的H圈问题
-
On Hamiltonian Cycle in Line Graph
线图中的哈密顿圈
-
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described .
通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
-
This paper studies the existence of Hamiltonian cycle in arrangement graphs which are a generalization of the star graphs .
本文证明星形图的推广安置图并行结构是有哈密尔顿回路的,从而为今后在这种网络上设计算法打下了基础。
-
Crossed cube is not as Hypercube as symmetric , and it is very difficult to construct a fault-free Hamiltonian cycle in the faulty crossed cube .
由于交叉立方体不像超立方体一样具有对称性,所以在故障的交叉立方体中很难构造出非故障的Hamiltonian圈。
-
For any n-dimensional ( n ≥ 3 ) folded hypercube with at most 2n-3 faulty edges in which each vertex is incident with at least two fault-free edges , it is proved that there exists a fault-free Hamiltonian cycle .
证明了在至多具有2n-3条故障边的n维(n≥3)折叠超立方体网络中,如果每个顶点至少与两条非故障边相邻,则存在一个不含故障边的哈密顿圈。