On embeddings of the difference graph of the intersection power graph and the power graph

The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The intersection power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices $x$, $y$ are adjacent if $\langle x\rangle \cap \langle y \rangle \neq \{e\}$. The difference graph $\mathcal{D}(G)$ of a finite group $G$ is the difference of the intersection power graph $\mathcal{G}_{1}(G)$ and power graph $\mathcal{P}(G)$ with all isolated vertices removed. We characterized all the finite nilpotent groups $G$ such that the difference graph is planar. Further, we determine all the finite nilpotent groups whose difference graph has genus at most $2$. Moreover, we prove that there does not exist any group whose difference graph is projective planar.