Total domination in cubic Knödel graphs

Doost Ali Mojdeh, Seyed Reza Musawi, Esmaeil Nazari +1

A subset $D$ of vertices of a graph $G$ is a \textit{dominating set} if for each $u\in V(G)\setminus D$, $u$ is adjacent to some vertex $v\in D$. The \textit{dominating number}, $γ…