• N.Sujatha
• K.Ameenal Bibi
• T.Ranjani

Let G be a simple (p,q) graph and let f:E(G)→{1,2,3,……n} be a mapping. Then f is called a prime E-cordial labelling of a graph G, if there exists an induced labeling f*:V(G)→{0,1} defined by f*(V)={∑f(uv/uv € E(G) (mod 2)}. A graph G which admits prime E-cordial labeling is called a prime E-cordial graph. Here, we have proved that Peterson graph, Fan graph, Flower graph admits prime E-cordial labeling.

Labeling, cordial labeling, E-cordial labeling, prime E-cordial labeling.

"Prime E-cordial labeling of some special graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 7, page no.994-996, July-2018, Available :http://www.jetir.org/papers/JETIR1807876.pdf

"Prime E-cordial labeling of some special graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 7, page no. pp994-996, July-2018, Available at : http://www.jetir.org/papers/JETIR1807876.pdf