The Dual-Server Domination Number of Some Graph Operations

Shrilaxmi Laxminarayana Rao, Sayinath Udupa N. V., Prathviraj N

A subset $S\subseteq V(G)$ is called a dual-server dominating set if there exists a partition ${\pi }_S=\{R,B\}$ of $S$ such that every vertex in $V(G)\setminus S$ has at least one nei…