Self-Dual Graphs
| dc.contributor.author | Hill, Alan | en |
| dc.date.accessioned | 2006-08-22T14:30:13Z | |
| dc.date.available | 2006-08-22T14:30:13Z | |
| dc.date.issued | 2002 | en |
| dc.date.submitted | 2002 | en |
| dc.description.abstract | The study of self-duality has attracted some attention over the past decade. A good deal of research in that time has been done on constructing and classifying all self-dual graphs and in particular polyhedra. We will give an overview of the recent research in the first two chapters. In the third chapter, we will show the necessary condition that a self-complementary self-dual graph have <i>n</i> ≡ 0, 1 (mod 8) vertices and we will review White's infinite class (the Paley graphs, for which <i>n</i> ≡ 1 (mod 8)). Finally, we will construct a new infinite class of self-complementary self-dual graphs for which <i>n</i> ≡ 0 (mod 8). | en |
| dc.format | application/pdf | en |
| dc.format.extent | 326106 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10012/1014 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.rights | Copyright: 2002, Hill, Alan. All rights reserved. | en |
| dc.subject | Mathematics | en |
| dc.subject | graph theory | en |
| dc.subject | mathematics | en |
| dc.subject | combinatorics | en |
| dc.subject | topology | en |
| dc.title | Self-Dual Graphs | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 1 of 1