Related Experiment Video
Updated: Mar 12, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
On the characterization of claw-free graphs with given total restrained domination number
1Department of Mathematics, Harbin Normal University, Harbin, 150025 China.
Abstract:
A set S of vertices in graph [Formula: see text] is a [Formula: see text], abbreviated TRDS, of G if every vertex of G is adjacent to a vertex in S and every vertex of [Formula: see text] is adjacent to a vertex in [Formula: see text]. The [Formula: see text] of G, denoted by [Formula: see text], is the minimum cardinality of a TRDS of G. Jiang and Kang (J Comb Optim. 19:60-68, 2010) characterized the connected claw-free graph G of order n with [Formula: see text]. This paper studies the total restrained domination number of claw-free graphs and characterizes the connected claw-free graph G of order n with [Formula: see text].
Related Concept Videos
Graphical Representation of Inequalities
Incomplete Dominance
Norton's Theorem
Constraints and Statical Determinacy
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Graphs of Functions

