Novel ways of enumerating restrained dominating sets of cycles

Sushmita Paul, Ratanjeet Pratap Chauhan, Srinibas Swain

Let $G=(V,E)$ be a graph. A set $S\subseteq V$ is a restrained dominating set (RDS) if every vertex not in $S$ is adjacent to a vertex in $S$ and to a vertex in $V-S$. The re…