东南大学学报（英文版）2002，Vol.18Issue(2)：184-187,4.
本质集的邻域并和无爪图的哈密尔顿性
Neighborhood Union of Essential Sets and Hamiltonicity of Claw-Free Graphs
摘要
Abstract
Let G be a graph, an independent set Y in G is called an essential independent set (or essential set for simplicity), if there is {y1,y2}Y such that dist (y1,y2)=2. In this paper, we will use the technique of the vertex insertion on l-connected (l=k or k+1,k≥2) claw-free graphs to provide a unified proof for G to be hamiltonian or 1-hamiltonian, the sufficient conditions are expressed by the inequality concerning ∑ki=0N(Yi) and n(Y) for each essential set Y={y0,y1,…,yk} of G, where Yi={yi,yi-1,…,yi-(b-1)}Y for i∈{0,1,…,k} (the subscriptions of yj's will be taken modulo k+1), b (0<b<k+1) is an integer, and n(Y)={v∈V(G): dist (v,Y)≤2}.关键词
哈密尔顿性/无爪图/邻域并/插点/本质集Key words
hamiltonicity/claw-free graph/neighborhood union/vertex insertion/essential set分类
数理科学引用本文复制引用
徐新萍..本质集的邻域并和无爪图的哈密尔顿性[J].东南大学学报（英文版）,2002,18(2):184-187,4.基金项目
The project partially supported by the National Natural Science Foundation of China(19971043). （19971043）
