from i=1 to r (P_m_i×P_n_i)的cordial性  

On Cordiality of the Union of Paths' Cartesian Product

作　　者：马黎政[1] 刘峙山[1] 陈丽娜[1] 

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

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

摘　　要：基于图的cordial标号,给出了3个引理:cordial图G联结上一个P2×Pn图得到的新图仍是cordial图;每个图P2k+1×P2l都有2个cordial标号;至少有1个图边数为偶数或者边数都为奇数但0边之和等于1边之和的2个cordial图的并为cordial图.最后运用这3个引理证明了from i=1 to r (P_(mi)×P_(ni)为cordial图.Based on cordial labelings of the graph, the article gives three lemmas：the union of G and P2 × Pn is cordial, if the graph G is cordial; the graph P2k＋1× P2l has two kinds of cordial labelings; the union of two cordial graphs is cordial, if there is at least one cordial graph in which the number of edges is even, or the number of edges in each graph is odd while the sum of the number of edges labeled 0 and the sum of the number of edges labeled 1 is equal. Finally,we prove that the union of paths＇ Cartesian product is the cordial graph.

关 键 词：CORDIAL图 路 笛卡尔积 

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