Existence and Non-Existence of some V4 Cordial graphs

L. Pandiselvi; A.Nagarajan; S.Navaneethakrishnan; A.Nellai Murugan

doi:https://doi.org/10.14445/22315373/IJMTT-V42P509

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 42 | Number 1 | Year 2017 | Article Id. IJMTT-V42P509 | DOI : https://doi.org/10.14445/22315373/IJMTT-V42P509

Existence and Non-Existence of some V4 Cordial graphs

L. Pandiselvi, A.Nagarajan, S.Navaneethakrishnan, A.Nellai Murugan

Citation :

L. Pandiselvi, A.Nagarajan, S.Navaneethakrishnan, A.Nellai Murugan, "Existence and Non-Existence of some V4 Cordial graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 42, no. 1, pp. 57-63, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V42P509

Abstract

Let be any abelian group. A graph G = (V(G), E(G)) is said to be A-cordial[6,9] 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 = 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 = 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 (when n 4(mod 8)), (n<7) are V4 Cordial graphs and Globe Gl(n)(when n 2(mod 4)), (when n 4(mod 8)) and (n≥7) are not V4 Cordial graphs. AMS Mathematics subject classification 2010:05C78.

Keywords

Cordial labeling, V4Cordial Labeling and V4Cordial Graph

References

[1] G.J. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinotorics, 16 (2009), #DS6.
[2] S.W Golomb, How to number a graph in graph Theory and computing, R.C. Read, ed., Academic Press, New York (1972), 23-37.
[3] A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs (International Symposium, Rome), July (1966).
[4] Frank Harary, Graph Theory, Narosa publishing house pvt. Ltd.,10th reprint 2001.
[5] J Gross and J Yeiien, Handbook of graph theory, CRC Press,2004.
[6] M. Hovey, A-cordial graphs, Discrete Math.,Vol 93(1991), 183-194.
[7] R. Tao, On k-cordiality of cycles, crowns and wheels, Systems Sci., 11 (1998), 227-229.
[8] M.Z. Youssef, On k-cordial labeling,Australas.J. Combin., Vol 43(2009), 31-37.
[9] M.V.Modha, K.K.Kanani, Some new families of 5-cordial graphs, International Journal of Mathematics and Soft Computing, Vol.5, No.1(2015), 129-141.
[10] L.Pandiselvi, S.NavaneethaKrishnan and A.NellaiMurugan, Path Related V4 Cordial graphs,International Journal of Recent advances in Multidisiplinary Research, Vol. 03, Issue 02, pp.1285-1294, February, 2016,
[11] 11.L.Pandiselvi, S.Navaneetha Krishnan and A.NellaiMurugan, Bi-Star V4 Cordial Graphs,International Journal Of Advanced Science and Research Vol. 1,Issue 2, Feb 2016. Pg no:14-21.
[12] L.Pandiselvi, A.NellaiMurugan, and S.NavaneethaKrishnan,V4 Cordial Graphs of Fan and Globe International Journal of Applied Research2016; 2(4): 344-350.
[13] L.Pandiselvi, S.Navaneethakrishnan,, A.NellaiMurugan, A.Nagarajan, Star Related V4 Cordial graphs, International Journal Of Mathematics And Computer Research [Volume 4 issue 10 Oct 2016] PageNo.1610-1621.