Outer-paired domination in graphs

Let G = (V,E) be a simple graph with vertex set V and edge set E. An outer-paired dominating set S of a graph G is a dominating set such that the subgraph induced by V \S has a perfect matching. Th...