Abstract

Let G = (V, E) be a simple graph. G is said to be a mean cordial graph if f : V(G)→{0,1,2} such that for each edge uv the induced map f* defined by f*(uv) =[f(u)+f(v)/2] where [x] denote the least integer which is ≤ x and |ef (0) - ef(1)| ≤ 1 where ef(0) is no.of edges with zero label. ef(1) is no.of edges with one label. The graph that admits a mean cordial labeling is called a mean cordial graph (MCG). In this paper , we proved that D2[Cn] , D2[K1,n] , D2[Pn + K1] , D2[Pn] are mean cordial graphs.

Keywords

References

1. Gallian. J.A,A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinotorics 6(2001)#DS6.
2. Harary,F., Graph Theory, Addision – Wesley Publishing Company Inc, USA, 1969.
3. A.NellaiMurugan, Studies in Graph theory- Some Labeling Problems in Graphs and Related topics, Ph.D Thesis, September 2011.
4. A.Nellai Murugan and V.Baby Suganya, Cordial labeling of path related splitted graphs, Indian Journal of Applied Research ISSN 2249 –555X,Vol.4, Issue 3, Mar. 2014, ISSN 2249 – 555X , PP 1-8.
5. A.Nellai Murugan and M. Taj Nisha, A study on divisor cordial labelling of star attached paths and cycles, Indian Journal of Research ISSN 2250 –1991,Vol.3, Issue 3, Mar. 2014, PP 12-17.
6. A.Nellai Murugan and V.Brinda Devi, A study on path related divisor cordial graphs International Journal of Scientific Research, ISSN 2277–8179,Vol.3, Issue 4, April. 2014, PP 286 – 291
7. A.Nellai Murugan and A. Meenakshi Sundari, On Cordial Graphs, International Journal of Scientific Research, ISSN 2277–8179,Vol.3, Issue 7, July. 2014, PP 419 - 420
8. A.Nellai Murugan and P. Iyadurai Selvaraj, Path Related Cup Cordial graphs. International Journal of Advanced Research, ISSN 2249 –555X,Vol.4, Issue 8, Aug. 2014
9. A.Nellai Murugan and P. Iyadurai Selvaraj, Cycle and Armed Cup Cordial graphs. International Journal of Innovative Science, Engineering and Technology, Research, ISSN 2348–7968,Vol.1, Issue 5, 2014.