A graph labeling assigns integers to the components of a graph (vertices, edges, or both), adhering to specific conditions. Let G be a graph with q edges. Then the graceful labeling is defined as one-one mapping from vertex set of G to {0, 1, ..., q} in this way each edge label arises due to absolute difference of vertex labels of its corresponding vertices, making all edge labels dissimilar. This paper shows that a class of coronas is graceful and of its 2nd kind under certain conditions. The corona graph considered here is a cycle graph with each or alternate vertex attached with two pendant edges.