• V. Mohan
• A. Sugumaran

Abstract. A difference cordial labeling of a graph G with p vertices is a bijective assignment of labels from {1, 2, …, p} to the vertices of G so that each edge e = uv is assigned the label | f(u) – f(v)| (mod 2), if the number of edges labeled with 1 and the number of edges labeled with 0 are differ by at most 1. In this paper we show that the graphs P(r . P_n^2), C(r . P_n^2), S(r . P_n^2), C_n^2 ʘv_n Pk and C_n^2 ʘv_n P_k^2 admit difference cordial labeling.

Keywords. Path union of graphs; cycle union of graphs; open star of graphs; difference cordial graphs.

"Difference cordial labeling of some graphs related to square graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 11, page no.589-594, November-2018, Available :http://www.jetir.org/papers/JETIR1811077.pdf

"Difference cordial labeling of some graphs related to square graph", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 11, page no. pp589-594, November-2018, Available at : http://www.jetir.org/papers/JETIR1811077.pdf