圈的路联图的Cordial性  

The Cordiality of the Path-union of the Different Cycles

作　　者：陈丽娜[1] 林珊华[2] 刘峙山[1] 

机构地区：[1]仰恩大学数学系,福建泉州362014 [2]泉州师范学院数学与计算机科学学院,福建泉州362000

出　　处：《泉州师范学院学报》2015年第2期107-109,共3页Journal of Quanzhou Normal University

基　　金：仰恩大学资助项目(KJ20143003)

摘　　要：利用剖分法,将含多个顶点的圈的路联图转化为仅含3,4,5,6个顶点的圈的路联图,并结合任意cordial图G路联Ci(i=3,4,5,6)是cordial图和Ci路联Cj(i,j=3,4,5,6)是cordial图两个结论,证明了具有不同顶点数的多个圈构成的路联图和树联图均是cordial图,所得结论推广了之前已有的结论.而剖分法是研究圈的标号的一种有效的方法.By the method of triangulation, the cordiality of the path-union of the different cycles is changed into the path-union union of the different cycles of C; （ i =3,4,5,6）.According to is cordial and the tree-union of the the lemma,it is found that the path different cycles is cordial too.Such re sults extend the previous conclusion and show the triangulation method is an effective method of cy cle-labeling.

关 键 词：Cordial性 路联图 树联图 

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