Gracefulness of Unconnected Graph C_(2h+1)(r_1,r_2,…,r_(2h+1))∪G_m
WU Yue-shen · Journal of Southwest University · 2014
The present paper proves that if h≥2then unconnected graph C2h+1(r1,r2,…,r2h+1)∪Gmis a graceful graph,where C2n+1is(2n+1)-vertex cycle,C2h+1(r1,r2,…,r2h+1)is the(r1,r2,…,r2n+1)-corona of the cycle C2n+1,and Gmis a graceful graph with medges,m =h-1+∑h k=1r2k.