{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/8394"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/8394","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Skolem sequences: Generalizations and applications","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>","abstract_html":"&lt;p&gt;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.&lt;/p&gt;","abstract_has_math":false,"creators":["Shalaby, Nabil"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics","school":null,"contributors":[],"advisors":["Rosa, Alexander"],"committee_chairs":[],"committee_members":[],"year":1991,"date_issued":"1991-08","date_published":"1991-08","updated_at":"2026-11-18T19:32:28Z","subjects":["Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/12051"],"render_values":[{"text":"https://doi.org/10.71548/12051","href":"https://doi.org/10.71548/12051","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/3601","4618","1668321"],"render_values":[{"text":"opendissertations/3601","href":null,"code":true},{"text":"4618","href":null,"code":true},{"text":"1668321","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/8394","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/8394","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F8394","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Rosa, Alexander"]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Shalaby, Nabil"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:42:48Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:42:48Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-12-01"]},{"key":"dc:date.issued","label":"Date","values":["1991-08"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/3601","4618","1668321"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/8394","https://doi.org/10.71548/12051"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Skolem sequences: Generalizations and applications"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Rosa, Alexander"],"dc:contributor.department":["Mathematics"],"dc:creator":["Shalaby, Nabil"],"dc:date.accessioned":["2014-06-18T16:42:48Z"],"dc:date.available":["2014-06-18T16:42:48Z"],"dc:date.created":["2010-12-01"],"dc:date.issued":["1991-08"],"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>"],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.other":["opendissertations/3601","4618","1668321"],"dc:identifier.uri":["http://hdl.handle.net/11375/8394","https://doi.org/10.71548/12051"],"dc:subject":["Mathematics"],"dc:title":["Skolem sequences: Generalizations and applications"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:32:28Z"}