拟无爪哈密尔顿图的邻集条件(英文)A Neighborhood Condition for Quasi Claw-free Hamiltonian Graphs
马小玲;
摘要(Abstract)：
作为无爪图的一种推广,拟无爪图类由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是哈密尔顿的.
关键词(KeyWords)： 邻集条件;拟无爪图;哈密尔顿图
基金项目(Foundation):
作者(Authors): 马小玲;
参考文献(References)：
- [1] West D B.Introduction to Graph Theory,Second Edition[M],Prentice Hall,Upper Saddle River,NJ(2001).
- [2] Ainouche A.Quasi claw-free graphs[J].Discrete Math,1998,129:13-26.
- [3] Faudree R J,R J Gould,Lindquester T E.Hamilltonian properties and adjacency conditions in K1,3-free graphs,Proceed- ings of the 6th International Conference on Theory and Applications of Graphs[A].Kalamazoo,1988.
- [4] T E Lindquester.The effects of distance and neighborhood union conditions on Hamiltonian properties in graphs[J].J Graph Theory,1991,13:139-148.
- [5] Zhao Kewen,Liu Bolian.A Neighborhood condition for vertices at distance two impling Hamiltonian[J].Soochow J Math- ematics,2006,32,71-177.