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 17 of 17 for “"distance-regular graphs"”.
-
Distance-Regular Graphs and Generalizations
A distance-transitive graph (GAMMA) is an undirected, locally finite graph where for any vertices u,v,x,y, (PAR-DIFF)(u,v) = (PAR-DIFF)(x,y) implies (sigma)u = x and (sigma)v = y for some automorphism (sigma) of (GAMMA). Distance-transitive graphs have certain combinatorial properties, which can be …
-
Bipartite Distance-Regular Graphs of Diameter Four
Using 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 …
-
An investigation of relationships between graph theory and coding theory
… and combinatorial properties of completely regular codes in distance-regular graphs. One of the main tools is the generalisation of Lloyd's Theorem.<br/><br/>There are connections with designs, orthogonal latin squares and finite projective planes and various existence and non-existence …
-
Almost perfect nonlinear functions and related combinatorial structures
… D. Fon-Der-Flaass, we can see that the relation graphs of some of these association schemes are distance-regular graphs. We discuss the local structure of these distance-regular graphs and characterize them.</p>
-
Distance-Biregular Graphs and Orthogonal Polynomials
This thesis is about distance-biregular graphs– when they exist, what algebraic and structural properties they have, and how they arise in extremal problems. We develop a set of necessary conditions for a distance-biregular graph to exist. Using these conditions and a computer, we develop tables of …
-
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 …
-
Quantum State Transfer in Graphs
… this thesis is that of determining which simple graphs admit perfect state transfer. For some classes of graphs the problem is solved. For example, a path on n vertices admits perfect state transfer if and only if n=2 or n=3. However, the general problem of determining all graphs that admit …
-
Doubly Almost Bipartite Leonard Pairs
… (LP) was motivated by the theory of Q-polynomial distance-regular graphs. In this dissertation, we will first give a brief introduction to LPs and to two closely-related classes of objects: (i) bipartite Leonard pairs (BLPs) and (ii) almost bipartite Leonard pairs (ABLPs). Taking these as …
-
Graph Coverings with Few Eigenvalues or No Short Cycles
… of X and Y which we will measure are their regularity, the spectra of their adjacency matrices, and the length of their shortest cycles. These statistics are highly interdependent and the main contribution of this thesis is to advance our understanding of this interdependence. We will see …
-
Thin Trees in Some Families of Graphs
… finding thin spanning trees in two families of graphs, namely, (1) distance-regular graphs (DRGs), and (2) planar graphs. For some families of DRGs such as strongly regular graphs, Johnson graphs, Crown graphs, and Hamming graphs, we give a polynomial-time construction of spanning trees 𝑇 of …
-
Classification of small class association schemes coming from certain combinatorial objects
… study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several …
-
Spectral Aspects of Cocliques in Graphs
… approaches to finding maximum cocliques in graphs. We focus on the relation between the eigenspaces of a graph and the size and location of its maximum cocliques. Our main result concerns the computational problem of finding the size of a maximum coclique in a graph. This problem is known to …
-
Quantum pure state transfer
… transfer. Moreover, we determine all complete graphs, complete bipartite graphs, cycles, and paths that admit perfect state transfer between m-strongly pure states. Constructions of infinite families of graphs admitting perfect state transfer are also given. We also characterise perfect state …
-
Incidence geometry from an algebraic graph theory point of view
… These geometries give rise to one or more graphs. By use of eigenvalue techniques, we obtain results on these graphs and on their substructures that are regular or extremal in some sense. The first chapter introduces the basic notions of geometries, such as projective and polar spaces. In …
-
Reconstructing a graph from its edge-contractions
… conjecture. It states that all simple graphs with at least four edges are reconstructible, that is they are uniquely determined from their collection of single edge contraction minors, called the deck. Similar questions have been studied in the past, the vertex reconstruction conjecture …