Abstract
Let G = (V, E) be a graph. A set S ⊇ V is a restrained dominating set if every vertex in V - S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination number of G, denoted γr(G), is the smallest cardinality of a restrained dominating set of G. We will show that if G is claw-free with minimum degree at least two and G ∉ {C4, C5,C7,C8,C11,C14,C17}, then γr(G) ≤.
Original language | English |
---|---|
Pages (from-to) | 693-706 |
Number of pages | 14 |
Journal | Graphs and Combinatorics |
Volume | 25 |
Issue number | 5 |
DOIs | |
Publication status | Published - Feb 2010 |
Keywords
- Claw-free graph
- Domination
- Graph
- Order of a graph
- Restrained domination
- Upper bound
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics