Face and Total face edge product cordial graphs

P. Lawrence Rozario Raj; R. Lawrence Joseph Manoharan

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 19 | Number 2 | Year 2015 | Article Id. IJMTT-V19P518 | DOI : https://doi.org/10.14445/22315373/IJMTT-V19P518

Face and Total face edge product cordial graphs

P. Lawrence Rozario Raj, R. Lawrence Joseph Manoharan

Citation :

P. Lawrence Rozario Raj, R. Lawrence Joseph Manoharan, "Face and Total face edge product cordial graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 19, no. 2, pp. 136-149, 2015. Crossref, https://doi.org/10.14445/22315373/IJMTT-V19P518

Abstract

In this paper, the face edge product cordial labeling of planar graphs Tn for even n, M(Pn) for odd n, the star of cycle Cn for odd n, the graph G obtained by joining two copies of planar graph G' by a path of arbitrary length and the path union of k copies of cycle Cn except for odd k and even n are presented. We also discussed the total face edge product cordial labeling of fn, Wn and the star of cycle Cn and face product cordial labeling of the graph G obtained by joining two copies of planar graph G' by a path of arbitrary length and the path union of k copies of cycle Cn except for odd k and even n.

Keywords

face edge product cordial graph, total face edge product cordial graph, face product cordial graph.

References

[1] J. Baskar Babujee and Shobana Loganathan, On signed product cordial labeling, Applied Mathematics, Vol 2, pp 1525-1530, 2011.
[2] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combinatoria, Vol 23, pp. 201-207, 1987.
[3] F. Harary, Graph theory, Addison Wesley, Reading, Massachusetts, 1972.
[4] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16, # DS6, 2014.
[5] P. Lawrence Rozario Raj and R. Lawrence Joseph Manoharan, face and total face signed product cordial labeling of planar graphs, communicated.
[6] P. Lawrence Rozario Raj and R. Lawrence Joseph Manoharan, face and total face product cordial graphs, communicated.
[7] K. W. Lih , On magic and consecutive labelings of plane graphs, Utilitas Math., 24, pp 165-197, 1983.
[8] J. Sedlacek, Problem 27, In Proc. Symposium on Theory of Graphs and its Applic., pp 163-167,1963.
[9] M. Sundaram, M. Ponraj and S. Somsundaram, Product Cordial Labeling of Graphs, Bull. Pure and Applied Sciences (Mathematics and Statistics), 23E, pp 155-163, 2004.
[10] M. Sundaram, R. Ponraj, and S. Somasundram, Total product cordial labeling of graphs, Bull. Pure Appl. Sci. Sect. E Math. Stat., 25, pp 199-203, 2006.
[11] S. K. Vaidya and C. M. Barasara, Edge Product Cordial Labeling of Graphs, J. Math. Comput. Sci. Vol 2, No. 5, pp 1436-1450, 2012.
[12] S. K. Vaidya and C. M. Barasara, Some New Families of Edge Product Cordial Graphs, Advanced Modeling and Optimization, Vol 15, No. 1, pp 103-111, 2013.
[13] S. K. Vaidya, and C. M. Barasara, Total edge product cordial labeling of graphs, Malaya Journal of Matematik Vol 3, No. 1, pp 55-63, 2013.