For a graph G = (V, E), a set S ⊆ V (G) is a total dominating set if it is dominating and both 〈S〉 has no isolated vertices. The cardinality of a minimum total dominating set in G is the total domination number. A set S ⊆ V (G) is a total restrained dominating set if it is total dominating and 〈V (G) − S〉 has no isolated vertices. The cardinality of a minimum total restrained dominating set in ...

Let G = (V,E) be a graph. A total restrained dominating set is a set S ⊆ V where every vertex in V \ S is adjacent to a vertex in S as well as to another vertex in V \S, and every vertex in S is adjacent to another vertex in S. The total restrained domination number of G, denoted by γ r (G), is the smallest cardinality of a total restrained dominating set of G. We determine lower and upper boun...

Let G = (V,E) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V − S is adjacent to a vertex in V − S. 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 total restrained domination number of G (restrained domination number of G, respectively),...

A robust finding in eating research is the so-called counterregulation in restrained eaters. This means that while normal subjects eat less during a taste test, after they consumed a preload, restrained eaters consume more. An explanation is that food exposure causes stronger physiological preparatory reactivity in the restrained eaters. This reactivity is experienced as craving and leads to an...

The present study sought to investigate the influence of self-activation on body and weight satisfaction in restrained and unrestrained eaters, after exposure to thin-ideal images. Restrained eaters (n=39) and unrestrained eaters (n=40) were randomly assigned to a self-activation manipulation versus a control manipulation. After the manipulation, all participants were exposed to eight thin-idea...

For a connected graph G = (V,E) of order at least two, a total restrained monophonic set S of a graph G is a restrained monophonic set S such that the subgraph induced by S has no isolated vertices. The minimum cardinality of a total restrained monophonic set of G is the total restrained monophonic number of G and is denoted by mtr(G). A total restrained monophonic set of cardinality mtr(G) is ...