摘要
设G是一个n阶k≥2连通无爪图,本文证明了:如果对G中任意距离大于3的两点都有|N(u)∪N(v)|≥n-δ(G)-k,则G是Hamiltonian.
Let G be a k≥2 connected claw-free graph of order n. This paper shows that if N(u)∪N(v)|≥n-δ(G) -k holds for every pair of vertices u,v with d (u,v)>2,then G is Hamiltonian.
关键词
无爪图
充分条件
证明
连通
距离
hamilton claw-free graphs
hamilton graphs
connected graphs
