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 |