A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f from V(G) to {1,2,...,|V(G)|} such that an edge uv is assigned the label 1 if f(u) + f(v) is even 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 that admits a sum divisor cordial labeling is called a sum divisor cordial graph. In this work, we establish that the complete bipartite graph Km,n, the splitting graph S′(Km,n), the bi-usual fan graph B(F1,n), and the fan graph Fm,n all admit sum divisor cordial labelings for every natural number m and n.