Abstract
dc:description.abstract<p>In this thesis the necessary conditions for the existence of near-, hooked near-, and indecomposable Skolem sequences are found and shown to be sufficient. We show also the existence of disjoint Skolem, disjoint hooked Skolem and disjoint near-Skolem sequences. Disjoint Skolem sequences are then applied to the existence problems for disjoint cyclic Steiner and Mendelsohn triple systems. We also consider Skolem labellings of graphs: we prove that every graph with v vertices can be embedded as an induced subgraph in a Skolem labelled graph on O(v³) vertices, and show that all paths, cycles and n-windmills can be Skolem labelled or minimum hooked Skolem labelled.</p>
Degree
thesis:*- Department dc:contributor.department
- Mathematics
- Year dc:date.issued
- 1991
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Shalaby, Nabil
- Advisor dc:contributor.advisor
-
- Rosa, Alexander
Subjects
dc:subject × 1Identifiers
dc:identifier.*- Identifier URI
- https://doi.org/10.71548/12051
- Dc Identifier Other
-
opendissertations/3601
4618
1668321