• V. Mohan
• A. Sugumaran

A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, 3, … , |V|} such that when each edge uv is assigned the label 1 if f(u) divides f(v) or f(v) divides f(u), and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph is called divisor cordial if, it admits divisor cordial labeling. In this paper we prove that the graphs such as DS(K1, n, n) , DS(Gl(n)), W-graph Wn, the graph B(m)ʘu_nK1, Herschel graph Hs and switching of an apex vertex in the Hershel graph Hs are divisor cordial graphs.

Cordial graph, divisor cordial labeling, divisor cordial graph, degree splitting graph, globe and Hershel graph.

"Some New Divisor Cordial Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 8, page no.229-238, August-2018, Available :http://www.jetir.org/papers/JETIR1808184.pdf

"Some New Divisor Cordial Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 8, page no. pp229-238, August-2018, Available at : http://www.jetir.org/papers/JETIR1808184.pdf