判别哈密尔顿图的新方法

A New Method of Judgement of a Hamiltonian Graph

提出求一个图的顶点覆盖的 VC算法 ,定义图的 VC表示式及其全闭链的概念。证明一个连通无向图是哈密顿图当且仅当其 VC表示式含有一条全闭链 。

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.