| The Neighborhood Union of Essential Sets and Hamiltonicity of Graphs |
| |
| 引用本文： | 徐新萍. The Neighborhood Union of Essential Sets and Hamiltonicity of Graphs[J]. 东北数学, 2004, 0(1) |
| |
| 作者姓名： | 徐新萍 |
| |
| 作者单位： | School of |
| |
| 基金项目： | The NNSF (19971043) of China, |
| |
| 摘 要： | Let G be a graph. An independent set Y in G is called an essential independent set (or essential set for simplicity) if there is {y1,y2} (?) Y such that dist (y1,y2) = 2. In this paper, we use the technique of the vertex insertion on l-connected (l = k or k + 1, k≥ 2) graphs to provide a unified proof for G to be hamiltonian, or hamiltonian-connected. The sufficient conditions are expressed
|
The Neighborhood Union of Essential Sets and Hamiltonicity of Graphs |
| |
| XU Xin-ping. The Neighborhood Union of Essential Sets and Hamiltonicity of Graphs[J]. Northeastern Mathematical Journal, 2004, 0(1) |
| |
| Authors: | XU Xin-ping |
| |
| Abstract: | |
| |
| Keywords: | hamiltonicity vertex insertion essential set |
| 本文献已被 CNKI 等数据库收录！ |
