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 19 of 19 for “"Regular Graph"”.
-
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 …
-
Matchings, Connectivity, and Eigenvalues in Regular Graphs
We study extremal and structural problems in regular graphs involving various parameters. In Chapter 2, we obtain the best lower bound for the matching number over $n$-vertex connected regular graphs in terms of edge-connectedness and determine when the matching number is minimized. We also …
-
Viewing extremal and structural problems through a probabilistic lens
… similar results for permutations, uniform hypergraphs, and vector spaces are obtained. In 2006, Barát and Thomassen conjectured that the edges of every planar 4-edge-connected 4-regular graph can be decomposed into disjoint copies of $S_3$, the star with three leaves. Shortly afterward, Lai …
-
On matchings and factors of graphs /
… sketch of matching and factor theory of graphs, and also introduce some necessary definitions and notation. In Section 2, we present a sufficient condition for the existence of a (g, f)-factor in graphs with the odd-cycle property, which is simpler than that of Lovasz's (g, f)-Factor …
-
A Characterization of Large (<em>t,r</em>)-Regular Graphs.
<p>A 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> …
-
GPU-accelerated Inference for Discrete Probabilistic Programs
… We make two key contributions : (1) a factor graph IR implemented in JAX that supports variable elimination and Gibbs sampling, and (2) a modeling DSL with a compiler that lowers programs to the factor graph IR. Our system enables significant performance optimizations through static analysis …
-
Polynomials of the Adjacency Matrix of a Graph (distance-Transitive, Distance-Regular, Orbit)
Given graphs (GAMMA) and (DELTA), and a real polynomial r(x), we will say that (DELTA) is generated from (GAMMA) by r(x) if r(A((GAMMA))) = A((DELTA)) where A((GAMMA)) and A((DELTA)) are adjacency matrices. For several interesting classes of graphs it is possible to determine all of the graphs …
-
The Structure and Properties of Clique Graphs of Regular Graphs
… and properties of <em>G </em>and its clique graph <em>cl</em><sub><em>t</em></sub><em> </em>(<em>G</em>) are analyzed for graphs <em>G </em>that are non-complete, regular with degree <em>δ </em>, and where every edge of <em>G </em>is contained in a <em>t </em>-clique. In a clique graph …
-
Generating Random Graphs with Tunable Clustering Coefficient
… at a node) as input and generate a random graph with a tunable clustering coefficient. We analyze them theoretically and empirically for the case of a regular graph. CONF-1 and CONF-2 generate a random graph with the degree sequence and the clustering coefficient anticipated from the input …
-
Incidence geometry from an algebraic graph theory point of view
… thesis is to apply techniques from algebraic graph theory to finite incidence geometry. The incidence geometries under consideration include projective spaces, polar spaces and near polygons. These geometries give rise to one or more graphs. By use of eigenvalue techniques, we obtain results …
-
Fusions of association schemes
… its initial introduction, many algebraists and graph theorists have been studying the existence, construction and generalizations of various association schemes [1, 3, 7, 8, 17, 19, 28, 29, 30]. Because of their impressive construction, association schemes are useful to these subjects and there …
-
Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts
… the Unique Games Conjecture when the constraint graph is restricted to the Boolean Hypercube. The Boolean Hypercube is a well studied graph family on which existing spectral methods fail to achieve a sub exponential time bound. We initiate the study of the behaviour of the standard semi-definite …
-
Nearly Balanced and Resolvable Block Designs
… partially balanced incomplete block designs, and regular graph designs.</p> <p>However, there are triples (<em>v, b, k</em>) in which binarity <em>precludes</em> near-symmetry. For these combinatorially problematic settings, recent explorations have resulted in new optimality results and insight …
-
Optimality and Construction of Designs with Generalized Group Divisible Structure
… as defined by Cheng & Wu (1981), and the semi-regular graph designs as defined by Jacroux (1985), to cases where off-diagonal entries of the concurrence matrix differ by at most the positive integer <em>l</em>. Sufficient conditions are derived for a NBBD(2) to be optimal under a given type-I …
-
Subconstituent Algebras of Latin Squares
… scheme. One also may construct several strongly regular graphs on the positions of a Latin square, where adjacency corresponds to any subset of the nonidentity relations described above. We describe the local spectrum and subconstituent algebras of such strongly regular graphs. Finally, we study …
-
Balanced allocations under incomplete information: New settings and techniques
… proven. - Next we analyse Two-Choice in the graphical setting, where bins are vertices of a graph and each ball is allocated to the lesser loaded of the vertices adjacent to a randomly sampled edge. We extend the results of Kenthapadi and Panigrahy (2006) proving that for dense expanders in …
-
Strategic Stochastic Coordination and Learning In Regular Network Games
… account the decisions of its neighbors over a regular network. In the first problem, we study the coordination in a team of strategic agents choosing to undertake one of the multiple tasks. We adopt a stochastic framework where the agents decide between two distinct tasks whose difficulty is …
-
High throughput path selection for unstructured data center networks
The increase in demand and popularity of cloud and big data applications has driven the need for higher throughput data center network design. Recent work to provide topologies with much denser interconnects pose a difficult challenge for routing of traffic within a data center. Even with proposals …
-
On some evolutionary game-theoretic vector flows
L'abstract è presente nell'allegato / the abstract is in the attachment