Let  be any abelian group. A graph G = (V(G), E(G)) is said to be A-cordial if there is a mapping f: V(G) A which satisfies the following two conditions with each edge

e= uv is labeled as f(u)*f(v).

(i)  1,  a,b A

(ii)  1,  a,b A       

Where = the number of vertices with label a.p

           = the number of vertices with label b.

           = the number of edges with label a.

           = the number of edges with label b.

               We note that if A = < V₄, *> is a multiplicative group. Then the labeling is known as V₄ Cordial Labeling. A graph is called a V₄ Cordial graph if it admits a V₄- Cordial Labeling. In this paper, we proved that  (n>2) and  are V₄- Cordial graphs.