Let G = (V,E) be a graph with p vertices and q edges. A Homo-Cordial Labeling of a Graph G with vertex set V is a bijection from V to {0, 1} such that each edge uv is assigned the label 1if f (u) =f (v) or 0 if f (u) ≠ f (v) with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by atmost 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. The graph that admits a Homo-Cordial Labeling (HoCL) is called Homo-Cordial Graph (HoCG). In this paper, we proved that Cycle related graphs Cycle C_n(n-odd), Double triangular snake C₂(P_n), D₂(C_n), Globe Gl(n), Crown CnʘK1 are Homo-Cordial Graphs.