Abstract
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 paper presents a survey of selected results on paired domination through 2013.
| Original language | English |
|---|---|
| Pages (from-to) | 101-166 |
| Number of pages | 66 |
| Journal | Utilitas Mathematica |
| Volume | 94 |
| Publication status | Published - Jul 2014 |
Keywords
- Matching number
- Paired dominating set
- Paired domination number
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics