本文選題：1-tough圖　切入點：哈密爾頓圖　出處：《華中師范大學(xué)》2015年碩士論文　論文類型：學(xué)位論文

【摘要】：我們知道1-tough圖和哈密爾頓圖是的兩類重要的圖.研究者們在尋找哈密爾頓圖的充分必要條件的過程中,發(fā)現(xiàn)了1-tough圖與哈密爾頓圖有很大的關(guān)系.D.Bauer和E.Schmeichel證明了當(dāng)G是1.tough圖,滿足δ≥(n+k-2)/3時,G是哈密爾頓圖B.Wei推廣了上面的結(jié)論得到：當(dāng)G是1-tough圖,滿足σ3≥n+k-2時,G是哈密爾頓圖.并且提出了一個猜想：當(dāng)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