Let $G$ be a graph and let $\sigma \subseteq V$ be a non-empty subset of $V - \sigma$ is said to be a self switching if $G \cong G_\sigma$ where $G_\sigma$ is obtained from $G$ by removing all edges between $\sigma$ and $V - \sigma$ and adding edges between all non-adjacent vertices of $\sigma$ and $V - \sigma$. A vertex $v'$ is the duplication of $v$ if all the vertices which are adjacent to $v$ in $G$ are also adjacent to $v'$ in $(vG)$, which is the duplication graph of $G$. A vertex $v$ is called a duplication self vertex switching of a graph $G$ if the resultant graph obtained after duplication $v$ has $v$ as a self vertex switching.