Components and colourings of singly- and doubly-periodic graphs

Simple item page
dc.contributor.authorSmith, Bethany Joy
dc.contributor.supervisorMacGillivray, Gary
dc.date.accessioned2010-01-26T22:48:26Z
dc.date.available2010-01-26T22:48:26Z
dc.date.copyright2006en
dc.date.issued2010-01-26T22:48:26Z
dc.degree.departmentDepartment of Mathematics and Statistics
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractSingly-periodic (SP) and doubly-periodic (DP) graphs arc infinite graphs which have translational symmetries in one and two dimensions, respectively. The problem of counting the number of connected components in such graphs is investigated. A method for determining whether or not an SP graph is k-colourable for a given positive integer k is given, and the question of deciding k-colourability of DP graphs is discussed. Colourings of SP and DP graphs can themselves be either periodic or aperiodic, and properties which determine the symmetries of their colourings arc also explored.en
dc.identifier.urihttp://hdl.handle.net/1828/2117
dc.languageEnglisheng
dc.language.isoenen
dc.rightsAvailable to the World Wide Weben
dc.subjectgraph theoryen
dc.subjectgraph coloringen
dc.subject.lcshUVic Subject Index::Sciences and Engineering::Mathematicsen
dc.titleComponents and colourings of singly- and doubly-periodic graphsen
dc.typeThesisen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Smith_B_MSc.pdf
Size:
31.89 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.83 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.