两树和图的Cordial性问题  

On Cordiality of the Join of Two Trees

作　　者：堵根民[1] 

机构地区：[1]呼和浩特职业学院数学系,内蒙古呼和浩特010051

出　　处：《延边大学学报（自然科学版）》2008年第4期253-254,共2页Journal of Yanbian University（Natural Science Edition）

基　　金：内蒙古自治区自然科学基金资助项目(200508010108)

摘　　要：两个图的和图Cordial性的研究结果甚少且方法单一.本文采用粘接边或删除边的方法,给出了两树和图为Cordial图的充分必要条件:两树不都是奇度图.There are few discussions about the cordiality of the join of two graphs and researching methods are almost the same. A both necessary and sufficient premise for the statement is given by adding or deleting edges, that the join of two trees is a Cordial graph if and only if neither is odd-degree.

关 键 词：Cordial性 树 两树和图 

分 类 号：O157.5[理学—数学]