A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, · · · , |V (G)|} such that an edge uv is assigned the label 1 if 2 divides f (u) + f (v) and 0 otherwise; and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that Pn2, Pn ? mK1, S(Pn ? mK1), D2(Pn), T (Pn), the graph obtained by duplication of each vertex of path by an edge, T (Cn), D2(Cn), the graph obtained by duplication of each vertex of cycle by an edge, C4(t), book, quadrilateral snake and alternate triangular snake are sum divisor cordial graphs.