Paired-Domination in Claw-Free Graphs.

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, while the paired-domination number, denoted by γ( G), is the minimum cardinality of a paired-dominating set in G. In this paper we investigate the paired-domination number in claw-free graphs. Specifically, we show that γ( G) ≤ (3 n − 1)/5 if G is a connected claw-free graph of order n with minimum degree at least three and that this bound is sharp. [ABSTRACT FROM AUTHOR]