数学季刊（英文版）
數學季刊（英文版）
수학계간（영문판）
CHINESE QUARTERLY JOURNAL OF MATHEMATICS
2010年
2期
244-248
,共5页
3-regular graph%Cordial graph%union graph
Diab proved the following graphs are Cordial; Pm ∪ K1,n if and only if(m,n)≠(1,2); Cm ∪ K1,n; Pm ∪ Kn; Cm ∪ Kn for all m and n except m ≡ 2(mod 4).In this paper,we proved the Cordiality on the union of 3-regular connected graph K3 and cycle Cm.First we have the Lemma 2,if uv ∈ E(G),G is Cordial,we add 4 vertices x,y,z,w in sequence to the edge uv,obtain a new graph denoted by G*,then G*is still Cordial,by this lemma,we consider four cases on the union of 3-regular connected graph Rs,and for every case we distinguish four subcases on the cycle Cm.
