A Sum of Power n Divisor Cordial labeling of a graph G with a collection of vertex V is a bijection f from V to {1,2,3,…,|V(G)|}, where an edge uv is assigned the value 1 if 2 divides (f(u)+f(v))^n and the edge uv is assigned the value 0 if 2 does not divides (f(u)+f(v))^n. The number of edges labeled with 0 and the number of edges labeled with 1 differ by no more than 1. A graph with a sum of power n divisor cordial labeling is called a Sum of Power n Divisor Cordial Graph. A graph G is said to be connected if every pair of vertices are joined by a path. Otherwise, it is disconnected. In this paper, we investigate sum of power n divisor cordial labeling of corona related connected graphs such as C_n o ̂K_1,5, C_n o ̃K_(1,m), 〖(P〗_n⊙K_1)⊙K_1,3, P_n⊙K_1,2 respectively.