Thesis (M.S.)--University of Wisconsin--Madison, 1969. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Thesis (Ph. D.)--Oregon Health & Science University, Department of Science & Engineering, August 2008. / Includes bibliographical references (leaves 98 - 106).

Thesis (Ph. D.)--University of Wisconsin--Madison, 1972. / Vita. Description based on print version record. Includes bibliographical references (leaves 59-62).

Thesis (Ph. D.)--University of Wisconsin--Madison, 1971. / Vita. Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1972. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

No description available.

The Taylor-Spence Drive (D) theory was investigated by comparing performance of high anxiety (HA), medium anxiety (MA) and low anxiety (LA) Ss, as measured by the Children's Manifest Anxiety Scale, on the test list of both a response-equivalence paradigm (A-B, A-C) and a control paradigm (D-B, A-C). The Ss were 60 grade six boys. The paired-associate learning tasks were designed to detect the debilitating effects of associative-stage competition in the experimental group for HA, MA and LA Ss respectively. A two (experimental conditions) by three (anxiety levels) by six (repeated trials) analysis of variance was performed on the data. There is a significant difference in performance between experimental and control groups on the test list (A-C), p < .0005. There are several trends favourable to the Taylor-Spence D theory but chance factors could have been involved since none of the hypotheses generated from the theory reached the .05 significance level. The first favourable trend is that HA and MA Ss' performance tends to be superior to LA Ss' in the control group on the test list (A-C). Also, HA Ss' performance is inferior to LA Ss' in the experimental group on the test list (A-C) giving support to the interaction hypothesis. / Education, Faculty of / Graduate

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, and a double dominating set is a dominating set that dominates every vertex of G at least twice. We show that for trees, the paired-domination number is less than or equal to the double domination number, solving a conjecture of Chellali and Haynes. Then we characterize the trees having equal paired and double domination numbers.

A paired dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, and a double dominating set is a dominating set that dominates every vertex of G at least twice. First a necessary and sufficient condition is given for a double dominating set (respectively, paired dominating set) to be minimal in G. We show that for clawfree graphs, the paired domination number is less than or equal to the double domination number. Then bounds on the double and paired domination numbers are presented. Sums involving these parameters are also considered.

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. We characterize the trees having unique minimum paired-dominating sets.