Enumeration of 2-factored dominating sets in fixed-width grid graphs
<p>A <em><span class="math inline">\(2\)</span>-factored dominating set</em> (<span class="math inline">\(2\)</span>fd-set) of a graph <span class="math inline">\(G=(V,E)\)</span> is a dominating set <span class="math inline">\(F\subseteq V\)</span> such that the induced subgraph <span class="math inline">\(G[F]\)</spa...