Paired domination and 2- distance Paired domination of the flower graph $f_{n\times m}$

Tanveer Iqbal, Syed Ahtsham Ul Haq Bokhary

Let $G=(V,E)$ be a graph without an isolated vertex. A set $D\subseteq V(G)$ is a $k$-distance paired domination set of $G$ if $D$ is a $k$-distance dominating set of $G$ and th…