| 判别哈密尔顿图的新方法 |
| |
| 引用本文： | 罗示丰.判别哈密尔顿图的新方法[J].广西科学院学报,2001,17(1):8-10. |
| |
| 作者姓名： | 罗示丰 |
| |
| 作者单位： | 广西大学计算机与信息工程学院 |
| |
| 摘 要： | 提出求一个图的顶点覆盖的VC算法，定义图的VC表示式及其全闭链的概念，证明一个连通无向图是哈密顿图当且仅当其VC表示式含有一条全闭链，并证明对构造全闭链有用的定理和推论。
|
| 关 键 词： | 顶点覆盖 VC算法 VC表示式 全闭链 哈密顿图 判别方法 连通无向图 |
| 收稿时间： | 2000/8/4 0:00:00 |
A New Method of Judgement of a Hamiltonian Graph |
| |
| Luo Shifeng.A New Method of Judgement of a Hamiltonian Graph[J].Journal of Guangxi Academy of Sciences,2001,17(1):8-10. |
| |
| Authors: | Luo Shifeng |
| |
| Institution: | College of Computer and Information Engineering, Guangxi University, Nanning, 530004 |
| |
| Abstract: | A VC algorithm to obtain the vertex covering of a graph is presented. The VC representative and full closed chain of the graph are defined. It is proved that a connective graph is Hamiltonian graph if and only if there is a full closed chain in it's VC representative. A proof is also given to some other theorem and inferences which are very useful in constructing a full closed chain. |
| |
| Keywords: | vertex covering VC algorithm VC representative full closed chain |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《广西科学院学报》浏览原始摘要信息 |
| 点击此处可从《广西科学院学报》下载免费的PDF全文 |
