On the Paired-Domination Subdivision Number of Trees
A paired-dominating set of a graph <i>G</i> without isolated vertices is a dominating set of vertices whose induced subgraph has perfect matching. The minimum cardinality of a paired-dominating set of <i>G</i> is called the paired-domination number <i>γ<sub>pr<...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-05-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/10/1135 |