Abstract
A set S of vertices in a graph G = (V, E) is a restrained dominating set of G if every vertex not in S is adjacent to a vertex in S and to a vertex in V \ S. The graph G is called restrained domination excellent if every vertex belongs to some minimum restrained dominating set of G. We provide a characterization of restrained domination excellent trees.
| Original language | English |
|---|---|
| Pages (from-to) | 337-351 |
| Number of pages | 15 |
| Journal | Ars Combinatoria |
| Volume | 87 |
| Publication status | Published - Apr 2008 |
| Externally published | Yes |
Keywords
- Excellent trees
- Restrained domination
ASJC Scopus subject areas
- General Mathematics