Research on the gracefulness of unconnected graph C_(4k+1)~(2)∪G_m
WU Yue-shen · Journal of Hefei University of Technology · 2013
It is proved that if k≥1,the unconnected graph C_(4k+1)~(2)∪G_(2k-1) is a graceful graph,G_(2k-1) is a graceful graph with 2k-1edges;if k≥2,the unconnected graph C_(4k+1)~(2)∪G_(2k-2) is a graceful graph,G_(2k-2) is a graceful graph with 2k-2edges.