A graph is said to be cordial if it has a \(0-1\) labeling that satisfies certain properties. A fan \(F_n\) is the graph obtained from the join of the path \(P_n\) and the null graph \(N_1\). In this paper, we investigate the cordiality of the join and the union of pairs of fans and graphs consisting of a fan with a path, and a cycle.