Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/8394
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Rosa, Alexander | en_US |
dc.contributor.author | Shalaby, Nabil | en_US |
dc.date.accessioned | 2014-06-18T16:42:48Z | - |
dc.date.available | 2014-06-18T16:42:48Z | - |
dc.date.created | 2010-12-01 | en_US |
dc.date.issued | 1991-08 | en_US |
dc.identifier.other | opendissertations/3601 | en_US |
dc.identifier.other | 4618 | en_US |
dc.identifier.other | 1668321 | en_US |
dc.identifier.uri | http://hdl.handle.net/11375/8394 | - |
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> | en_US |
dc.subject | Mathematics | en_US |
dc.subject | Mathematics | en_US |
dc.title | Skolem sequences: Generalizations and applications | en_US |
dc.type | thesis | en_US |
dc.contributor.department | Mathematics | en_US |
dc.description.degree | Doctor of Philosophy (PhD) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 1.82 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.