W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs

Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba

A set $D\subseteq V$ of a graph $G=(V,E)$ is called an outer-connected dominating set of $G$ if every vertex $v$ not in $D$ is adjacent to at least one vertex in $D$, and the in…