树和2-正则图联的Cordial性

Cordiality of Union of Tree and 2-Regular Graphs

由文献[1]可知,标号图的发展比较快,但树和2-正则图[2]的联的Cordial性仍未解决.本文以分类讨论的思想和方法解决了这一问题,为完善和发展Cordial图的内容做出了一份贡献.同时应用本文结论也很容易证明D(1,2)图[3]是Cordial图的结论.

In this paper,the cordiality of the union of a tree and 2-regular graphs is given by using classification and discussion,which will contribute to the improvement and development of the Cordial graph. And meanwhile,the conclusion that D（ 1,2） graph and graph [3]belong to the Cordial graph can be simply proved by using the theory.