邻集并与图的Hamilton连通性  

NEIGHBORHOOD UNIONS AND HAMILTON-CONNECTEDNESS OF GRAPHS

作　　者：储茂权 丁立风 

出　　处：《太原机械学院学报》1992年第4期374-376,共3页

摘　　要：设G是一个n阶三连通图,且最小度δ(G)≥t,本文证明了若对于G中任意距离为2的点u和v,均有|N(u)∪N(v)|≥n-t+2,则G是Hamilton连通图。Suppose that G is a 3-connected graph of order n such that δ(G)≥t. We show that if for all pairs of nonadjacent vertices u, v with distance 2 satisfy|N(u)∪N(v)|≥b-t+2, then G is Hamilton-connected.

关 键 词：集 邻集并 连通图 

分 类 号：O157.5[理学—数学]