摘要
设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.
关键词
集
邻集并
连通图
sets
neighborhood unions
connected graphs
Hamilton-connected graph
distance
