Let G be a connected simple graph. A subset S of a vertex set V (G) is called an outer-convex dominating set of G if for every vertex v ∈ V (G)\S, there exists a vertex x ∈ S such that xv is an edge of G and V (G)\S is a ...