A graph labeling assigns integer 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 a one-to-one mapping from the vertex set of G to {0, 1, ..., q} so that each edge label arises due to the absolute difference of vertex labels of its corresponding vertices, making all edge labels dissimilar. This paper demonstrates that a class of coronas is graceful and of the second kind under specific conditions. The corona graph considered here is a cycle graph with each or every other vertex attached to two pendant edges.