Skolem labelled snakes and stegosaurs
LE3 .A278 2015
2015
Clarke, Nancy
Acadia University
Bachelor of Science
Honours
Mathematics and Statistics
Mathematics & Statistics
Skolem labelling is a vertex labelling problem of simple graphs where the labels in D = f1; 2; 3; :::; ng are placed on a graph containing 2n vertices, such that every integer appears exactly twice and the distance between the two appearances of i is i, for each i 2 D. In this thesis we will be looking at Rosa's triangular snakes as well as generalising these snakes and developing a new class of graphs called stegosaurs, which involve inserting a path of length one between two intersecting blocks of a triangular snake. It will be shown that the classes outlined here, with the exception of one case which will be proven to be not labellable, can be Skolem labelled through proving the nth case, as well as how to label the graphs given the number of blocks they contain.
The author retains copyright in this thesis. Any substantial copying or any other actions that exceed fair dealing or other exceptions in the Copyright Act require the permission of the author.
https://scholar.acadiau.ca/islandora/object/theses:1197