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 20 of 152 for “"Regular graphs"”.
-
Almost regular graphs
Master of Science (M.S.)
-
On strongly regular graphs
Strongly regular graphs are regular graphs with the additional property that the number of common neighbours for two vertices depends only on whether the vertices are adjacent or non-adjacent. From an algebraic point of view, a graph is strongly regular if its adjacency matrix has exactly three …
-
Computer generation of regular graphs
… problem of computer generation of non-isomorphic regular graphs of degree d on n points. The uork consists of a study of various properties and representations of regular graphs and a discussion of hov these might be useful in solving the isomorphism problem in the computer generation of regular …
-
Distance-Regular Graphs and Generalizations
… (sigma) of (GAMMA). Distance-transitive graphs have certain combinatorial properties, which can be studied independently; a graph with these properties is called distance-regular.
-
Quantum Walks on Strongly Regular Graphs
… transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We begin by finding the eigenvalues of matrices …
-
New constructions of strongly regular graphs
There are many open problems concerning strongly regular graphs: proving non-existence for parameters where none are known; proving existence for parameters where none are known; constructing more parameters where examples are already known. The work addressed in this dissertation falls into the …
-
Eigenvalue fluctuations for random regular graphs
… by studying the spectral properties of random regular graphs. Specifically, we prove limit theorems for the fluctuations of linear spectral statistics of random regular graphs. We find both universal and non-universal behavior. Our most important tool is Stein's method for Poisson …
-
Bipartite Distance-Regular Graphs of Diameter Four
… a method by Godsil and Roy, bipartite distance-regular graphs of diameter four can be used to construct $\{0,\alpha\}$-sets, a generalization of the widely applied equiangular sets and mutually unbiased bases. In this thesis, we study the properties of these graphs. There are three main themes …
-
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 …
-
Chromatic Thresholds of Regular Graphs with Small Cliques
<p>The chromatic threshold of a class of graphs is the value <em>θ</em> such that any graph in this class with a minimum degree greater than <em>θn</em> has a bounded chromatic number. Several important results related to the chromatic threshold of triangle-free graphs have been reached in the last …
-
Splitter theorems for 3- and 4-regular graphs
Let g be a class of graphs and ≤ be a graph containment relation. A splitter theorem for g under ≤ is a result that claims the existence of a set O of graph operations such that if G and H are in g and H≤G with G≠H, then there is a decreasing sequence of graphs from G to H, say G=G0≥G1≥G2...Gt=H, …
-
The Packing Chromatic Number of Random d-regular Graphs
… denoted by Xp(G). Let Gn,d denote the random d-regular graph on n vertices. In this thesis, we show that for any fixed d >= 4, there exists a positive constant cd such that P(Xp(Gn,d) >=cdn) = 1 − on(1).
-
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 …
-
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 …
Page 1 of 8