K_1∪2△K_2∪G是Cordial图

K_1∪2△K_2∪ Gis a Cordial Graph

本文证明了一个1—正则图和2△个2—正则图与最大度是△的无向有限简单图G的联图是Cordial图的结论.由文献[1]可见,图论研究的进展和应用都比较快,本文论述的这个问题却仍没有解决,且由于本文简单图G的任意性,足见其重要性.

It was proved that K_1∪2△K_2∪G is a cordial graph.Though with rapid development and application of the graph research in reference [1],the question discussed in this paper had never been answered.This paper also employed a simple G graph,which was key important.