| 关于图的哈密尔顿性的新的充分条件 |
| |
| 引用本文： | 徐新萍.关于图的哈密尔顿性的新的充分条件[J].中国科学技术大学学报,2005,35(6):743-747. |
| |
| 作者姓名： | 徐新萍 |
| |
| 作者单位： | 江苏教育学院数学系,江苏,南京,210013 |
| |
| 基金项目： | Supported by the NNSF （10271114,10301031）. |
| |
| 摘 要： | 设G是一个图,对于任意U()V(G),令N(U)=Uu∈UN(u),d(U)=|N(U)|.我们给出了两个结果:设s和t是正整数,G是(2s 2t 1)-连通图,且阶为n;若对于任两个强不交独立集ST,|S|=s,|T|=t,有d(S) d(T)≥n 1,则G是哈密尔顿连通的或1-哈密尔顿.
|
| 关 键 词： | 哈密尔顿性 独立集 邻域并 |
| 文章编号： | 0253-2778（2005）06-0743-05 |
| 收稿时间： | 2004-05-14 |
| 修稿时间： | 2005-10-08 |
New Sufficient Conditions on Hamiltonicity of Graphs |
| |
| XU Xin-ping.New Sufficient Conditions on Hamiltonicity of Graphs[J].Journal of University of Science and Technology of China,2005,35(6):743-747. |
| |
| Authors: | XU Xin-ping |
| |
| Institution: | Dept. of Math. , Jiangsu Institute of Education, Nanjing 210013,China |
| |
| Abstract: | Let G be a graph, for any U () V(G), let N(U) = Uu∈UN(u),d(U) =|N(U)| , we give two results: Let s and t be two positive integers and G be a (2s+2t+1)-connected graph of order n; If d(S) + d(T) ≥ n+ 1 for every two strongly disjoint independent sets S and T with |S| = s and |T| = t, respectively, then G is hamiltonian-connected or 1-hamiltonian. |
| |
| Keywords: | hamiltonicity independent sets the neighborhood union |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
