【摘要】 利用路收缩技术,证明了,如果有向图D满足下列条件中的任何一个,(1)最小半度δ0(D)≥(n+p+q)/2;(2)D是(p+q+1)强连通有向图,且d+(x)+d+(y)+d-(u)+d-(v)≥2(n+p+q)-1,这里,x,y是任意控制顶点对,u,v是任意被控制顶点对;(3)D的弧数超过(n-1)2+q2+p;那么D是强(p,q)哈密尔顿的.更多还原

【Abstract】 Using the path-contraction technique,we prove that if a digraph D satisfies(i)the minimum semi-degree δ0(D)≥(n+p+q)/2(1≤p+q≤n-2),or(ii)D is(p+q+1)-strong and d+(x)+d+(y)+d-(u)+d-(v)≥2(n+p+q)-1 for every pair x,y of dominating vertices and every pair u,v of dominated vertices,or(iii)D contains more than(n-1)2+q2+p;(1≤q2+p≤n-1) arcs,then D is strongly(p,q)-Hamiltonian.更多还原