Upper paired domination versus upper domination
A paired dominating set $P$ is a dominating set with the additional property that $P$ has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph $G$ is called the upper domination number of $G$, denoted by $\Gamma(G)$, the maximum cardinality of a minimal paired do...
| Автори: | , |
|---|---|
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Discrete Mathematics & Theoretical Computer Science
2021-12-01
|
| Серія: | Discrete Mathematics & Theoretical Computer Science |
| Предмети: | |
| Онлайн доступ: | https://dmtcs.episciences.org/7331/pdf |