| 摘要: |
| 提出求一个图的顶点覆盖的VC算法,定义图的VC表示式及其全闭链的概念。证明一个连通无向图是哈密顿图当且仅当其VC表示式含有一条全闭链,并证明对构造全闭链有用的定理和推论。 |
| 关键词: 顶点覆盖 VC算法 VC表示式 全闭链 |
| DOI： |
| 投稿时间：2000-08-04 |
| 基金项目: |
|
| A New Method of Judgement of a Hamiltonian Graph |
|
Luo Shifeng
|
| (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. |
| Key words: vertex covering VC algorithm VC representative full-closed chain |
