哈密顿图的英文

• hamiltonian path

• 顿:    pause; halt; stop
• 图:    picture; chart; drawing; map
• 哈密顿:    hamilton jacobi equation; hamilton jacobi theory; hamilton-jacobi equation; hamiltonian; william rowan hamilton
• 哈密尔顿图:    hamiltonian path
• 哈密顿变量:    hamiltonian variable

例句与用法

1. Fractional factors and fractional hamilton graphs
   分数因子和分数哈密顿图
2. Upper bounds for the domination number of a kind of hamiltonian graphs
   一类哈密顿图的控制数的上界
3. In this paper we intrest in the following results of cycle : oberly and sumner proved the following result in [ 10 ] : theorem a [ 10 ] if g is a connected , locally connected claw - free graph on n > 3 vertices , then g is hamiltonian
   本文感兴趣的是圈方面的以下结果： oberlyandsumner [ 10 ]证明了下面的结果：定理a顶点数不小于3的连通、局部连通的无爪图是哈密顿图
4. Apparently , that g is fully cycle extendable which implied hamiltonicity is a stronger result than g is hamiltonian , so that we study the problem of fully cycle extendable is equate to study the hamiltonian problem which is one of the four difficult problems in graph theory . later on , many authors oberserved many other special classes of graphs by improved claw - free graphs because they are not satisfied with the study of claw - free graphs
   显然图g是完全圈可扩的是比图g是哈密顿图更强的结果，所以研究完全圈可扩问题就研究了图论的难题之一哈密顿问题后来人们不满足于无爪图的研究，把无爪图进行改进得到了一系列的特殊图类

百科释义

哈密顿图（，或）是一个无向图，由天文学家哈密顿提出，由指定的起点前往指定的终点，途中经过所有其他节点且只经过一次。在图论中是指含有哈密顿回路的图，闭合的哈密顿路径称作哈密顿回路（Hamiltonian cycle），含有图中所有顶的路径称作哈密顿路径。

其他语言

哈密顿图的法语：Graphe hamiltonien
哈密顿图的日语：ハミルトン路
哈密顿图的俄语：Гамильтонов граф