1) fractional (directed) Hamiltonian cycle
分数(有向)Hamilton圈
2) directed hamilton cycle
Hamilton有向圈
3) Hamiltonian factorization
Hamilton圈分解
1.
Hamiltonian factorization of 2~n P~m degrees Cayley graphs
2~np~m阶群上Cayley图的Hamilton圈分解
4) hamiltonian digraphs
Hamilton有向图
1.
In this paper,it is proved that for a digraph D of order n≥7,if d(x)+d(y)≥(5n)/2-5 for every pair of non-adjacent vertices x,y with a common out-neighbor or a common in-neighbor,then D is hamiltonian and for 3≤n≤6,there are non-hamiltonian digraphs satisfying that d(x)+d(y)≥(5n)/2-5 for every pai.
猜想:如果D中每一对不相邻且有公共外邻或公共内邻的顶点x,y都有d(x)+d(y)≥2n-1,那么D是Hamilton有向图。
5) directed Hamil-tonian cycle
有向Hamilton图
6) The number of Hamilton cycle
Hamilton圈的条数
补充资料：连分数的渐近分数
连分数的渐近分数
convergent of a continued fraction
连分数的渐近分数l阴ve吧e时ofa阴‘毗d五，比.;n侧卫xp口.坦”八卯6‘] 见连分数(con tinued fraction).
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条