On the number of outer connected dominating sets of graphs

Saeid Alikhani, Mohammad H. Akhbari, C. Eslahchi +1

Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $…