期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Degree Sum and Neighborhood Intersections for Hamilton-connection
1
作者 GERen-fu 《徐州师范大学学报(自然科学版)》 CAS 2002年第3期15-18,共4页
Let S^23 denote an independent set with mini dist (u,v)|u, v∈S} = 2 and |S|=3. Our main result is the following theorem: Let G be a 3-connected graph of order n such that d(u)+d(v)+d(w)≥n+1+|N(u)∩N(v)∩N(w)|for any... Let S^23 denote an independent set with mini dist (u,v)|u, v∈S} = 2 and |S|=3. Our main result is the following theorem: Let G be a 3-connected graph of order n such that d(u)+d(v)+d(w)≥n+1+|N(u)∩N(v)∩N(w)|for any independent set S^23={u,v,w}, then G is Hamilton-connected. 展开更多
关键词 sum度 邻域交条件 哈密尔顿连通 数学分析
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部