Semipaired Domination in Some Subclasses of Chordal Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$-element subsets such that the vertices in each…