| Hamilton图的判定算法 |
| |
| 引用本文： | 赵一平.Hamilton图的判定算法[J].乌鲁木齐成人教育学院学报,2006,14(2):86-87. |
| |
| 作者姓名： | 赵一平 |
| |
| 作者单位： | 乌鲁木齐成人教育学院 师训处 |
| |
| 摘 要： | Hamilton问题是图论的一个重要问题,判定一个图是否是Hamilton图虽然已找到了几个充分条件和必要条件,但不是充要条件,而且用这些条件来判定一个图是否是Hamilton图非常不好用,本文给出一个算法,对于任意给定的无向简单连通图可以判定其是否是Hamilton图,如果是Hamilton图,还可给出Hamilton回路。
|
| 关 键 词： | Hamilto图 Hamilton回路 算法 图论 |
| 文章编号： | 1671-5179(2006)02-0086-02 |
| 修稿时间： | 2006年3月23日 |
Decision Algorithm of Hamilton Graph |
| |
| ZHAO Yi-ping.Decision Algorithm of Hamilton Graph[J].Journal of Urumqi Adult Education Institute,2006,14(2):86-87. |
| |
| Authors: | ZHAO Yi-ping |
| |
| Abstract: | The Hamiltonian problem is an important problem of graph theory .Although several sufficient conditions and requisite conditions have been found, they are not necessary and sufficient conditions,and what is more,using these above mentioned conditions to judge whether it is a Hamiltonian graph or not is not easy .This paper introduces an algorithm which could judge whether it is a Hamiltonian graph or not only based on the randomly given undirectional and simple connected graph.If it is a Hamiltonian graph, recirculating loop can also be made. |
| |
| Keywords: | Hamiltonian graph Hamilton recirculating loop algorithm graph theory |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
