Vertices in all minimum paired-dominating sets of block graphs

Lei Chen, Changhong Lu, Zhenbing Zeng

Let $G=(V,E)$ be a simple graph without isolated vertices. A set $S\subseteq V$ is a paired-dominating set if every vertex in $V-S$ has at least one neighbor in $S$ and the subgrap…