2021
DOI: 10.46298/dmtcs.7331
|View full text |Cite
|
Sign up to set email alerts
|

Upper paired domination versus upper domination

Abstract: 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 dominating set in $G$ is called the upper paired domination number of $G$, denoted by $\Gamma_{pr}(G)$. By Henning and Pradhan (2019), we know that $\Gamma_{pr}(G)\leq 2\Gamma(G)$ for any graph $G$ without isolated ve… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 18 publications
(26 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?