Paired Domination in Graphs
A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number of G. This chapter presents a survey of the major results on paired domination with an emphasis on bounds for the paired domination number.
Desormeaux, Wyatt J.; Haynes, Teresa W.; and Henning, Michael A.. 2020. Paired Domination in Graphs. Developments in Mathematics. Vol.64 31-77. https://doi.org/10.1007/978-3-030-51117-3_3 ISSN: 1389-2177