Self-Dual Graphs

Self-Dual Graphs

Show other versions (1)

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

Full description

Bibliographic Details
Main Author: Hill, Alan
Format: Others
Language:en
Published: University of Waterloo 2006
Subjects:
Mathematics
graph theory
mathematics
combinatorics
topology
Online Access:http://hdl.handle.net/10012/1014
id ndltd-WATERLOO-oai-uwspace.uwaterloo.ca-10012-1014
record_format oai_dc
spelling ndltd-WATERLOO-oai-uwspace.uwaterloo.ca-10012-10142013-01-08T18:49:25ZHill, Alan2006-08-22T14:30:13Z2006-08-22T14:30:13Z20022002http://hdl.handle.net/10012/1014The 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> &#8801; 0, 1 (mod 8) vertices and we will review White's infinite class (the Paley graphs, for which <i>n</i> &#8801; 1 (mod 8)). Finally, we will construct a new infinite class of self-complementary self-dual graphs for which <i>n</i> &#8801; 0 (mod 8).application/pdf326106 bytesapplication/pdfenUniversity of WaterlooCopyright: 2002, Hill, Alan. All rights reserved.Mathematicsgraph theorymathematicscombinatoricstopologySelf-Dual GraphsThesis or DissertationCombinatorics and OptimizationMaster of Mathematics
collection NDLTD
language en
format Others
sources NDLTD
topic Mathematics
graph theory
mathematics
combinatorics
topology
spellingShingle Mathematics
graph theory
mathematics
combinatorics
topology
Hill, Alan
Self-Dual Graphs
description 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> &#8801; 0, 1 (mod 8) vertices and we will review White's infinite class (the Paley graphs, for which <i>n</i> &#8801; 1 (mod 8)). Finally, we will construct a new infinite class of self-complementary self-dual graphs for which <i>n</i> &#8801; 0 (mod 8).
author Hill, Alan
author_facet Hill, Alan
author_sort Hill, Alan
title Self-Dual Graphs
title_short Self-Dual Graphs
title_full Self-Dual Graphs
title_fullStr Self-Dual Graphs
title_full_unstemmed Self-Dual Graphs
title_sort self-dual graphs
publisher University of Waterloo
publishDate 2006
url http://hdl.handle.net/10012/1014
work_keys_str_mv AT hillalan selfdualgraphs
_version_ 1716572418011561984

Similar Items