Tight bound for independent domination of cubic graphs without $4$-cycles

Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1

Given a graph $G$, a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$. The domination number of $G$, denoted $\gamma (G)$, is the min…