International Journal of Advanced Science and Research

International Journal of Advanced Science and Research


International Journal of Advanced Science and Research
International Journal of Advanced Science and Research
Vol. 1, Issue 2 (2016)

Bi-Star V4 Cordial graphs


L Pandiselvi, S Navaneethakrishnan, A Nellai Murugan

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 = < V4, *> is a multiplicative group. Then the labeling is known as V4 Cordial Labeling. A graph is called a V4 Cordial graph if it admits a V4- Cordial Labeling. In this paper, we proved that  (n>2) and  are V4- Cordial graphs.

AMS Mathematics subject classification 2010: 05C78
Download  |  Pages : 14-21
How to cite this article:
L Pandiselvi, S Navaneethakrishnan, A Nellai Murugan. Bi-Star V4 Cordial graphs. International Journal of Advanced Science and Research, Volume 1, Issue 2, 2016, Pages 14-21
International Journal of Advanced Science and Research