Labelling Algorithms for Paired-domination Problems in Block and Interval Graphs

Lei Chen Changhong Lu Zhenbing Zeng

Let $G=(V,E)$ be a graph without isolated vertices. A set $S\subseteq V$ is a paired-domination set if every vertex in $V-S$ is adjacent to a vertex in $S$ and the subgraph induced…