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 if the subgraph induced by S contains a perfect matching. We characterize the set of vertices of a tree that are contained in all, or in no, minimum paired-dominating sets of the tree.
| Original language | English |
|---|---|
| Pages (from-to) | 283-294 |
| Number of pages | 12 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 10 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Nov 2005 |
| Externally published | Yes |
Keywords
- Paired-domination number
- Tree
ASJC Scopus subject areas
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Control and Optimization
- Computational Theory and Mathematics
- Applied Mathematics