Switching of a vertex and independent domination number in graphs

The switching of a vertex $v$ of a graph $G$ means removing all the edges incident to $v$ and adding the edges joining $v$ to every vertex which is not adjacent to $v$ in $G$.The resultant graph is denoted by $widetilde G$. In this paper, we explore the concept of independent domination in the context of switching of a vertex in a graph.