Vol. 2, Issue 4, Part F (2016)

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 edgee= 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.

= 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 = 4,*> 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 = + and Globe (Gl(n))areV₄ Cordial graphs.