Abstract A set S of vertices in a graph G is paired dominating if every vertex adjacent to and the subgraph induced by contains perfect matching (not necessarily as an subgraph). The domination number, $$\gamma _{\mathrm{pr}}(G)$$ γ pr ( G</mml:m...