1-tough条件下哈密顿图的一个充分条件

发布时间：2018-03-20 04:11

  本文选题：1-tough图　切入点：哈密尔顿图　出处：《华中师范大学》2015年硕士论文　论文类型：学位论文

【摘要】：我们知道1-tough图和哈密尔顿图是的两类重要的图.研究者们在寻找哈密尔顿图的充分必要条件的过程中,发现了1-tough图与哈密尔顿图有很大的关系.D.Bauer和E.Schmeichel证明了当G是1.tough图,满足δ≥(n+k-2)/3时,G是哈密尔顿图B.Wei推广了上面的结论得到：当G是1-tough图,满足σ3≥n+k-2时,G是哈密尔顿图.并且提出了一个猜想：当G是n≥3的1-tough图,满足σ3≥max{n, n+k-3},则G是哈密尔顿图.在本文中我们证明了这个猜想.
[Abstract]:We know that 1-tough graphs and Hamiltonian graphs are two kinds of important graphs. In their search for the necessary and sufficient conditions of Hamiltonian graphs, researchers have found that 1-rough graphs have a great relationship with Hamiltonian graphs. D. Bauer and E. Schmeichel prove that if G is a rough graph, In this paper, we generalize the above conclusion that if G is a 1-tough graph and 蟽 3 鈮，

本文编号：1637440