Research on Hamilton Graph Discrimination

In this paper, many ordinary graphs are subjected to Hamilton graph discrimination by using some necessary conditions and sufficient conditions proposed by many researchers in the past, and features of peaks (V), sides (E) and planes(r) of each graph are analyzed. In the same time, regulations including V = E and Hamilton circle divides into two planes: internal (yin) plane and external (yang) plane, i.e. r = 2, after planar embedding. And then a necessary and sufficient condition and its proving for discriminating Hamilton graph is find out. Some instances of discrimination are also presented.