摘要
让G(V ,E)是n阶图 ,在Ore条件下 ,即G的不相邻的任意两点x ,y均有d(x) +d(y) ≥n ,则G是Hamilton图 .进一步考虑G的不相邻的任意两点x ,y均有d(x) +d(y) ≥n- 1,和长为 2的任意两点x ,y均有d(x) +d(y) ≥n - 1,两个条件下G的Hamilton性 .
Let G to be simple graph of order n ,by Ore Condition,i.e. for any nonadjacent two vertices x,y with d(x)+d(y)≥n ,then The authors consider any nonadjacent two vertices x,y and any two vertices x,y which distance to be 2 with d(x)+d(y)≥n+1 ,then what is the result of the graph on hamiltonian.
出处
《河北大学学报(自然科学版)》
CAS
2001年第4期366-367,共2页
Journal of Hebei University(Natural Science Edition)