1P.G. and Research Department of Mathematics, Hajee Karutha Rowther Howdia College, Uthamapalayam-625533, Tamil Nadu, India. E-mail: sheriffhodmaths@gmail.com
2Research Scholar, School of Mathematics, Madurai Kamaraj University, Madurai-625 021, Tamil Nadu, India. E-mail: farhana.abbas69@gmail.com
AMS Mathematics Subject Classification (2010): 05C78
In this paper, we investigate the face integer edge cordial labeling of duplication of each vertex by an edge in fan graph fn for n ≥ 2, planar graph G′ is obtained from joining the outer vertex of the two copies of the planar graph G by a path of arbitrary length and S′(K1, n).
Integer edge cordial labeling, face integer edge cordial labeling, splitting graph
(216.73.216.69)
