On the $n-$dominating graph of specific graphs

Saeid Alikhani, Davood Fatehi

Let $G=(V,E)$ be a graph. A set $S\subseteq V(G)$ is a dominating set, if every vertex in $V(G)\backslash S$ is adjacent to at least one vertex in $S$. The $k$-dominating graph of…