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 5 of 5 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 …
-
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 …
-
Algebraic methods in graph theory
… in understanding the structural properties of graphs. In general, we can use the eigenvalues of the adjacency matrix of a graph to study various properties of graphs. In this thesis, we obtain the whole spectrum of a family of graphs called Wenger graphs Wm (q ). We also study the a conjecture …
-
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 …
-
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 …