2-正则图的cordial性  

On Cordiality of the 2-Regular Graphs

作　　者：徐丽平[1] 刘峙山[1] 倪臣敏[1] 

机构地区：[1]仰恩大学信息与计算科学系,福建泉州362014

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

摘　　要：研究2-正则图G的cordial性,证明了2-正则图G是cordial图的充要条件为|G|≠2(mod4);取消了文献[1](Cahit I.On cordial and 3-equitbale labeling of graphs.Utilitas Math,1990,37:189-198)中具有4n+2条边的Euler图不是cordial图这一定理中连通性条件,证明了具有4n+2条边并且顶点的度都是偶数的图不是cordial图.The cordiality of 2-regular graphs is studied and the sufficient and necessary condition for 2-regular graphs G to be cordial is given. The theorem for the cordiality of Eulerian graphs is generalized to even degree graphs.

关 键 词：cordial标号 2-正则图 CORDIAL图 

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