Sum divisor cordial labeling of disjoint union of paths and subdivided star

A bijective map rho from V(Omega) -> {1,2, ...vertical bar V(Omega)vertical bar} is called sum divisor cordial labeling for graph Omega so that for every uv is an element of E(Omega) edge is fixed the label 1 if 2 divides rho(u) + rho(v) and 0 otherwise, then the difference between number of edges labeled with 1 and the number of edges labeled with 0 by at most 1. A graph is called sum divisor cordial graph if it admits sum divisor cordial labeling. in present article, we investigate the disconnected graph such as the disjoint union of paths and subdivided star are sum divisor cordial graphs.