Let G be a graph with vertex set V . A set D ⊆ V is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in V \D has a neighbor in V \D. The minimum cardinality of a total restrained dominating set of G is called the total restrained domination number of G, and is denoted by γtr(G). In this paper, we prove that if G is a connected graph of order n ≥ 4...

Restrained eating refers to the intention to restrict food intake deliberately in order to prevent weight gain or to promote weight loss (Tuschl, 1990). There are several self-report instruments for the assessment of restrained eating, of which the three most commonly used are the Restraint Scale (RS; Herman andMack, 1975; Herman and Polivy, 1975; Polivy et al., 1978), and the restraint subscal...