Strong coalitions in graphs

Hamidreza Golmohammadi, Saeid Alikhani, Nima Ghanbari +2

For a graph $G=(V,E)$, a set $D\subset V(G)$ is a strong dominating set of $G$, if for every vertex $x\in V(G)\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x…