拟无爪哈密尔顿图的邻集条件(英文)  

A Neighborhood Condition for Quasi Claw-free Hamiltonian Graphs

作　　者：马小玲[1] 

机构地区：[1]新疆大学数学与系统科学学院,新疆乌鲁木齐830046

出　　处：《新疆大学学报（自然科学版）》2009年第2期155-158,共4页Journal of Xinjiang University(Natural Science Edition)

摘　　要：作为无爪图的一种推广,拟无爪图类由Ainouche引入.已经知道:如果阶数为n的3-连通无爪图G,对于每一对距离为2的点都有|N(x)∪N(y)|≥(2n-6)/3,那么图G是哈密尔顿的.在本文中,推广了上述的结论并且得到:如果阶数为n的3-连通拟无爪图G,对于每一对距离为2的点都有|N(x)∪N(y)|≥(2n-6)/3,那么图G是哈密尔顿的.As a generalization of claw-free graphs, the class of quasi claw-free graphs was introduced by Ainouche. It is known that： if G is a 3-connected K1,3-free graph of order n such that IN（x）∪N（y）｜ ≥ （2n=6）/3 for each pair of vertices x,y with d（x,y） = 2, then G is Hamiltonian. In this paper, we extend the above result and obtain： if G is a 3-connected quasi claw-free graph of order n such that ｜N（x）∪N（y）｜ ≥ （2n-6）/3 for each pair of vertices x,y with d（x,y） = 2, then G is Hamiltonian.

关 键 词：邻集条件 拟无爪图 哈密尔顿图 

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