On the Gracefulness of Disjoint Union Graph C4n, C4n and Pm
Zhishang Zhang, Chunyue Wang · 2009
The graph C4nis a 4n-cycle with 4n vertexes and the graph Pmis a path with m+1 vertexes. Furthermore, The graph C4n¿C4n¿Pmdenotes the disjoint union of two copies C4nand Pm. In this paper, the graph C4n¿C4n¿Pmis proved to be graceful for all n and m = 1 or m¿n + 2.