Paired-domination
Shannon L. Fitzpatrick, Bert L. Hartnell · Discussiones Mathematicae Graph Theory · 1998
We are interested in dominating sets (of vertices) with the additional property that the vertices in the dominating set can be paired or matched via existing edges in the graph.This could model the situation of guards or police where each has a partner or backup.This paper will focus on those graphs in which the number of matched pairs of a minimum dominating set of this type equals the size of some maximal matching in the graph.In particular, we characterize the leafless graphs of girth seven or more of this type.