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

图的几乎哈密尔顿的新的充分条件
引用本文:徐新萍,徐敏,周兴和.图的几乎哈密尔顿的新的充分条件[J].南京师大学报,2006,29(4):8-13.
作者姓名:徐新萍  徐敏  周兴和
作者单位:[1]江苏教育学院数学系,江苏南京210013 [2]中国科学院数学与系统科学研究院应用数学所,北京100080 [3]京师范大学数学与计算机科学学院,江苏南京210097
摘    要:利用插点方法就κ-连通图G的独立集、本质独立集及G的部分平方图的独立集的邻域交,研究图的几乎哈密尔顿性,得到了关于图的几乎哈密尔顿的三个新的充分条件.

关 键 词:插点  本质集  部分平方图  几乎哈密尔顿
文章编号:1001-4616(2006)04-0008-06
收稿时间:2005-05-17
修稿时间:2005-05-17

New Sufficient Conditions on Almost-Hamilton of Graphs
Xu Xinping,Xu Min,Zhou Xinghe.New Sufficient Conditions on Almost-Hamilton of Graphs[J].Journal of Nanjing Normal University(Natural Science Edition),2006,29(4):8-13.
Authors:Xu Xinping  Xu Min  Zhou Xinghe
Institution:1. Department of Mathematics, Jiangsu Institute of Education, Nanjing 210013, China;2. Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China;3. School of Mathematics and Computer Science, Nanjing Normal University, Nanjing 210097, China
Abstract:In this paper, we use the technique of the vertex insertion, considering the neighborhood intersections of the essential independent sets and the independent set of the partially square graphs on k-connected graphs G, to study almost Hamilton of graphs, and obtained three new sufficient conditions.
Keywords:vertex insertion  essential sets  partially square graphs  almost Hamilton~
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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