Total restrained domination in claw-free graphs

Abstract

A set S of vertices in a graph G=(V,E) is a total restrained dominating set (TRDS) of G if every vertex of G is adjacent to a vertex in S and every vertex of V−S is adjacent to a vertex in V−S. The total restrained domination number of G, denoted by γtr(G), is the minimum cardinality of a TRDS of G. In this paper we characterize the claw-free graphs G of order n with γtr(G)=n. Also, we show that γtr(G)≤n−Δ+1 if G is a connected claw-free graph of order n≥4 with maximum degree Δ≤n−2 and minimum degree at least 2 and characterize those graphs which achieve this bound.