Regular Two-Graphs and Equiangular Lines

WinnSpace/Manakin Repository

Regular Two-Graphs and Equiangular Lines

Show simple item record

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.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 Waterloo en_US
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

Files in this item

Files Size Format View
Masters_Thesis_Gosselin.pdf 358.4Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search WinnSpace


Advanced Search

Browse

My Account