【摘要】 对简单图 G=(V,E) ,Ore定理告诉我们 :如果对 G的每一对不相邻的顶点 u,v都有 d(u) +d(v)≥ |V|,则G有哈密尔顿圈 .证明了 ,若 G仅包含一对不相邻的顶点 u,v,满足 d(u) +d(v) <|V|,G仍有哈密尔顿圈更多还原

【Abstract】 For a simple graph G=(V,E),Ore theorem states that G is Hamiltonian if every pair of nonadjacent vertices u and v satisfies d(u)+d(v)≥|V|.In this paper,it’s proved that if G contains only one pair of nonadjacent vertices u and v satisfying d(u)+d(v)<|V|,then G is still Hamiltonian.更多还原