严格有向二部图含有向Hamilton路的一个充分条件

A Sufficient Condition of Strictly Directed Bipartite Graph with Directed Hamiltonian Path

给出了严格有向二部图含有向Hamilton路的一个充分条件,即:设D是n阶严格有向二部图(其中V(D)=(X,Y),‖X|-|Y‖≤1),若V(D)中任两个不相邻的顶点x,y,都有d(x)+d(y)≥2n-4,则D含有向Hamilton路.

A sufficient condition of strictly directed bipartite graph with directed Hamiltonian path is given, that is, suppose that D is a strictly directed Bipartite graph on n vertices, (in it V(D) = (X,Y), ||X| - |Y|| [less-than or equal to] 1), if two arbitrarily nonadjacent vertices x,y in V(D) have d(x)+d(y) greater than or equal 2n-4, then D has directed Hamiltonian path.