| dc.contributor.advisor | Master of Mathematics in Combinatorics and Optimization | |
| dc.contributor.author | Gosselin, Shonda | |
| dc.date.accessioned | 2010-12-17T17:27:23Z | |
| dc.date.available | 2010-12-17T17:27:23Z | |
| dc.date.issued | 2004 | |
| dc.identifier.citation | Gosselin, Shonda. Regular Two-Graphs and Equiangular Lines; A thesis
presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Mathematics in Combinatorics and Optimization. Waterloo, Ontario, 2004. | |
| dc.identifier.uri | http://hdl.handle.net/10680/291 | |
| dc.description.abstract | Regular two-graphs are antipodal distance-regular double coverings of the complete graph, and they have many interesting combinatorial properties. We derive a construction for regular two-graphs containing cliques of specified order from their connection to large sets of equiangular lines in Euclidean space. It is shown that the existence of a regular two-graph with least eigenvalue τ containing a clique of order d depends on the existence of an incidence structure on d points with special properties. Quasi-symmetric designs provide examples of these incidence structures. | en_US |
| dc.description.sponsorship | University of Waterloo | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | University of Winnipeg | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.subject | Regular Two-Graphs | en_US |
| dc.subject | Equiangular Lines | en_US |
| dc.subject | Euclidean space | en_US |
| dc.subject | Linear Algebra | en_US |
| dc.title | Regular Two-Graphs and Equiangular Lines | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | Master of Mathematics in Combinatorics and Optimization | |
| dc.publisher.grantor | University of Waterloo | |
