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 |
| Θέματα: | |
| Διαθέσιμο Online: | https://dmtcs.episciences.org/7331/pdf |