| 关于哈密顿图的一点注记 |
| |
| 引用本文： | 夏维群.关于哈密顿图的一点注记[J].同济大学学报(自然科学版),1989,17(2):229-231. |
| |
| 作者姓名： | 夏维群 |
| |
| 作者单位： | 同济大学应用数学系 |
| |
| 摘 要： | 如果图G含有一个过G中每个顶点恰好一次的圈,则称G是一个哈密顿图。对于含有两个不相邻顶点a和b的图G,本文给出了一些条件,如果G满足这些条件,且G ab是哈密顿图,则G也是哈密顿图。
|
| 关 键 词： | 哈密顿图 注记 连通图 |
A Note on Hamiltonian Graph |
| |
| Xia Weiqun.A Note on Hamiltonian Graph[J].Journal of Tongji University(Natural Science),1989,17(2):229-231. |
| |
| Authors: | Xia Weiqun |
| |
| Institution: | Xia Weiqun Department of Applied Mathematics |
| |
| Abstract: | If a graph G contains a circuit in which all the vertices of G occur ex-actly once, then G is called a hamiltonian graph. For a graph G containing two non-adjacent vertices a and b, this paper gives some conditions such that, if G satisfies these conditions and G ab is a hamiltonian graph, then G is also a hamiltonian graph. |
| |
| Keywords: | Hamiltonian graph k-connected graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
