【摘要】 应用随机过程理论——马尔柯夫链,我们得到有向图存在Hamilton圈的必要条件。一个不可约有向图（?）=（V,E）具有周期d,|V|=n,V能分解成V=C₁+C₂+…+C_d且C_k,K=1,2,…,d,是不相交的非空循环类。如果|C_k|不等于n/d,那么有向图不是一个有向的Hamilton图。更多还原

【Abstract】 Applying the stochastic processes theory-Markov Chain,We get a necessary con- dition about the existence of Hamilton circle in a directed graph.An irreducible di- rected graph =（V,E）has a period and|V|=n.V can be decomposed into V=C₁ +C₂+…+C_d,while C_k,k=1,2,…,d,are disjoint nonempty cyclic classes.If|C_k|is not equal to n/d,then directed graph is not a directed Hamilton graph.更多还原