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 12 of 12 for “"r-regular"”.
-
Nested (2,r)-regular graphs and their network properties.
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph G is (2, r)-regular where p, s, and m are positive integers, and m ≥ 2, then when n is sufficiently large, then G is isomorphic to G = Ks+mKp, where 2(p-1)+s …
-
Fixed block configuration GDDs with block size 6 and (3, r)-regular graphs
… λ2)s. Chapter 3 addresses characterizing (3, r)-regular graphs. We begin with providing previous results on the well studied class of (2, r)-regular graphs and some results on the structure of large (t; r)-regular graphs. In Chapter 3, we completely characterize all (3, 1)-regular and (3, …
-
A Characterization of Large (<em>t,r</em>)-Regular Graphs.
A graph G is a (t,r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. In this thesis, we will present a complete characterization of (t,r)-regular graphs of order n if n is sufficiently large. Furthermore, we will show that all graphs of …
-
On Properties of r<sub>w</sub>-Regular Graphs
… has the same degree, then the graph is called a regular graph. That is, if deg(v) = r for all vertices in the graph, then it is denoted as an r-regular graph. A graph G is said to be vertex-weighted if all of the vertices are assigned weights. A generalized definition for degree regularity for …
-
Maximum packings in tripartite graphs
… design theory perspective. We define edge △-r-regular tripartite graphs, inspired by Agrawal's design theory construction, and consider the conjecture that if one side of a tripartite graph is a minimum transversal of the triangles in the graph, then there exists a packing of triangles in the …
-
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.
-
Properties of graphs with large girth
… a class of iterative probabilistic algorithms in regular graphs, called locally greedy algorithms, which will provide bounds for graph functions in regular graphs with large girth. This class is useful because, by conveniently setting the parameters associated with it, we may derive algorithms for …
-
Impact of Vitamin D intake and high-fat diets on liver and muscle: a rat model of Western and Mediterranean Diets
… defects induced by different dietary regimens: regular diet (R); regular diet with vitamin D supplementation (R-DS) and regular diet with vitamin D restriction (R-DR); high-fat butter-based diets (HFB-DS and HFB-DR) with 41% energy from fat; high-fat extra-virgin olive oil-based diets (HFEVO-DS …
-
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, …
-
Some approaches to graph fragmentation with application to clustering geo-tagged data
… for a wider class of graph models including r-regular graphs, random graphs and infinite random graphs on the integers.<br/>Inspired by the interest in triangles in social networks, we also investigate another variation called triangle-fragmentation, in which every vertex points to the …
-
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}$ …
-
Analysis Of Four Particle Systems
… time threshold-two contact process on a random r-regular graph on n vertices. In this process, a vertex with at least two occupied neighbors at time t will be occupied at time t + 1 with probability p, and vacant otherwise. We use a suitable isoperimetric inequality to show that if r is larger …