Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"r-regular"”.
-
Nested (2,r)-regular graphs and their network properties.
<p>A graph <i>G</i> is a (<i>t</i>, <i>r</i>)-regular graph if every collection of <i>t</i> independent vertices is collectively adjacent to exactly <i>r</i> vertices. If a graph <i>G</i> is (2, <i>r</i>)-regular where <i>p</i>, <i>s</i>, and <i>m</i> are positive integers, and <i>m</i> ≥ 2, then …
-
Extremal problems involving forbidden subgraphs
… the maximum number of edges that contain no $r$-regular subgraphs. We also establish upper bounds for the number of edges in graphs and hypergraphs with no edge-disjoint equicovering subgraphs.
-
A Characterization of Large (<em>t,r</em>)-Regular Graphs.
… graph <em>G</em> is a (<em>t</em>,<em>r</em>)-regular graph if every collection of <em>t</em> independent vertices is collectively adjacent to exactly <em>r</em> vertices. In this thesis, we will present a complete characterization of (<em>t</em>,<em>r</em>)-regular graphs of order <em>n</em> …
-
Migraines and Mindfulness Meditation: Does Engaging Spirituality Make A Difference?
… in one of three techniques: relaxation (R), regular mindfulness (RM), and spiritual mindfulness (SM). The R group was given little instruction other than to clear the mind and release tension; the RM group was trained using a mindfulness-of-breathing script; and the SM group was trained using …
-
The Parameterized Complexity of Degree Constrained Editing Problems
… such as Degree r Deletion, Cubic Subgraph, r-Regular Subgraph, f-Factor and General Factor. We show that in general if both k and r are part of the parameter, problems in the WDCE class are fixed-parameter tractable, and if parameterized by k or r alone, the problems are intractable in a …
-
On matchings and factors of graphs /
… further results, and we show that (a) every r-regular graph G with the odd-cycle property has a k-factor, where 0 ≤ k ≤ r and k|V(G)| ≡ 0 (mod 2), (b) every graph G with the strong odd-cycle property with k|V(G)|≡ 0 (mod 2) is k-factorable if and only if G is a km-regular graph for some m ≥ 1, …
-
Pairs and predicates in expansions of o-minimal structures
… $(\mathbb{R},<,+,0,1)$ by a predicate for an $r$-regular subset of $[0,1]$. The focus of Chapter 3 of this thesis is the extension $T_{\mathcal{G}}$ of a complete o-minimal $\mathcal{L}$-theory $T$ to the language $\mathcal{L}_{\mathcal{G}}:=\mathcal{L} \cup \{ \mathcal{G} \}$, where $\mathcal{G}$ …