New constructions of strongly regular graphs
MetadataShow full item record
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 last two categories. The methods used involve symmetry, geometry, and experimentation in computer algebra systems. In order to construct new strongly regular graphs, we rely heavily on objects found in finite geometry, specifically two intersection sets and generalized quadrangles, in which six independent ...