Abstract
A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching. The minimum cardinality of a paired-dominating set of G is the paired-domination number of G, denoted by γpr(G). In this work, we present several upper bounds on the paired-domination number interms of the maximum degree, minimum degree, girth and order. Copyright © 2008 Published by Elsevier Ltd.
| Original language | English |
|---|---|
| Pages (from-to) | 1194-1198 |
| Journal | Applied Mathematics Letters |
| Volume | 21 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - Nov 2008 |
Citation
Chen, X.-G., Shiu, W. C., & Chan, W. H. (2008). Upper bounds on the paired-domination number. Applied Mathematics Letters, 21(11), 1194-1198. doi: 10.1016/j.aml.2007.10.029Keywords
- Paired-domination number
- Maximum degree
- Minimum degree
- Girth