首页 | 本学科首页   官方微博 | 高级检索  
     检索      

拟无爪哈密尔顿图的邻集条件
引用本文:马小玲.拟无爪哈密尔顿图的邻集条件[J].新疆大学学报(理工版),2009,26(2):155-158.
作者姓名:马小玲
作者单位:新疆大学数学与系统科学学院,新疆乌鲁木齐830046
摘    要:作为无爪图的一种推广,拟无爪图类Ainouche引入.已经知道:如果阶数为礼的3-连通无爪图G,对于每一对距离为2的点都有IN(x)∪N(y)|≥(2n-6)/3,那么图G是哈密尔顿的.在本文中,推广了上述的结论并且得到:如果阶数为n的3-连通拟无爪图G,对于每一对距离为2的点都有|N(x)∪N(y)|≥(2n-6)/3,那么图G是哈密尔顿的.

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

A Neighborhood Condition for Quasi Claw-free Hamiltonian Graphs
MA Xiao-ling.A Neighborhood Condition for Quasi Claw-free Hamiltonian Graphs[J].Journal of Xinjiang University(Science & Engineering),2009,26(2):155-158.
Authors:MA Xiao-ling
Institution:MA Xiao-ling (College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, China)
Abstract: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.
Keywords:Neighborhood condition  quasi claw-free graph  hamiltonian graph
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号