Browsing Combinatorics and Optimization by Subject "Distance-Regular Graphs"
Now showing items 1-2 of 2
-
Bipartite Distance-Regular Graphs of Diameter Four
(University of Waterloo, 2014-08-11)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 ... -
Spectral Aspects of Cocliques in Graphs
(University of Waterloo, 2014-05-01)This thesis considers spectral 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 ...