{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/6553"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/6553","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Almost Selfcomplementary Graphs and Extensions","abstract":"<p>In this thesis the concept of selfcomplementary graphs is extended to almost selfcomplementary graphs. We dine a p-vertex graph to be almost selfcomplementary if it is isomorphic to its complement with respect to Kp-e, the complete graph with one edge deleted. An almost selfcomplementary graph with p vertices exists if and only if p=2 or 3 (mod 4), ie., precisely when selfcomplementary graphs do not exist. We investigate various properties of almost selfcomplementary graphs and examine the similarities and differences with those of selfcomplementary graphs.</p> <p>The concepts of selfcomplementary and almost selfcomplementary graphs are combined to define so-called k-selfcomplementary graphs which include the former two classes as subclasses. Although a k-selfcomplementary graph may contain fewer edges than a selfcomplementary or an almost selfcomplementary graph it is found that the former preserves most of the properties of the latter graphs.</p> <p>The notion of selfcomplementarity is further extended to combinatorial designs. In particular, we examine whether a Steiner triple system (twofold triple system, and a Steiner system S(2,4,v), respectively) can be partitioned into two isomorphic hypergraphs.</p>","abstract_html":"&lt;p&gt;In this thesis the concept of selfcomplementary graphs is extended to almost selfcomplementary graphs. We dine a p-vertex graph to be almost selfcomplementary if it is isomorphic to its complement with respect to Kp-e, the complete graph with one edge deleted. An almost selfcomplementary graph with p vertices exists if and only if p=2 or 3 (mod 4), ie., precisely when selfcomplementary graphs do not exist. We investigate various properties of almost selfcomplementary graphs and examine the similarities and differences with those of selfcomplementary graphs.&lt;/p&gt; &lt;p&gt;The concepts of selfcomplementary and almost selfcomplementary graphs are combined to define so-called k-selfcomplementary graphs which include the former two classes as subclasses. Although a k-selfcomplementary graph may contain fewer edges than a selfcomplementary or an almost selfcomplementary graph it is found that the former preserves most of the properties of the latter graphs.&lt;/p&gt; &lt;p&gt;The notion of selfcomplementarity is further extended to combinatorial designs. In particular, we examine whether a Steiner triple system (twofold triple system, and a Steiner system S(2,4,v), respectively) can be partitioned into two isomorphic hypergraphs.&lt;/p&gt;","abstract_has_math":false,"creators":["Das, Kumar Pramod"],"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":1989,"date_issued":"1989-05","date_published":"1989-05","updated_at":"2026-11-18T19:36:30Z","subjects":["Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/16670"],"render_values":[{"text":"https://doi.org/10.71548/16670","href":"https://doi.org/10.71548/16670","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/1861","3040","1356834"],"render_values":[{"text":"opendissertations/1861","href":null,"code":true},{"text":"3040","href":null,"code":true},{"text":"1356834","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/6553","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/6553","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%2F6553","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":["Das, Kumar Pramod"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:36:00Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:36:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-06-14"]},{"key":"dc:date.issued","label":"Date","values":["1989-05"]},{"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/1861","3040","1356834"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/6553","https://doi.org/10.71548/16670"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>In this thesis the concept of selfcomplementary graphs is extended to almost selfcomplementary graphs. We dine a p-vertex graph to be almost selfcomplementary if it is isomorphic to its complement with respect to Kp-e, the complete graph with one edge deleted. An almost selfcomplementary graph with p vertices exists if and only if p=2 or 3 (mod 4), ie., precisely when selfcomplementary graphs do not exist. We investigate various properties of almost selfcomplementary graphs and examine the similarities and differences with those of selfcomplementary graphs.</p> <p>The concepts of selfcomplementary and almost selfcomplementary graphs are combined to define so-called k-selfcomplementary graphs which include the former two classes as subclasses. Although a k-selfcomplementary graph may contain fewer edges than a selfcomplementary or an almost selfcomplementary graph it is found that the former preserves most of the properties of the latter graphs.</p> <p>The notion of selfcomplementarity is further extended to combinatorial designs. In particular, we examine whether a Steiner triple system (twofold triple system, and a Steiner system S(2,4,v), respectively) can be partitioned into two isomorphic hypergraphs.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Almost Selfcomplementary Graphs and Extensions"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Rosa, Alexander"],"dc:contributor.department":["Mathematics"],"dc:creator":["Das, Kumar Pramod"],"dc:date.accessioned":["2014-06-18T16:36:00Z"],"dc:date.available":["2014-06-18T16:36:00Z"],"dc:date.created":["2010-06-14"],"dc:date.issued":["1989-05"],"dc:description.abstract":["<p>In this thesis the concept of selfcomplementary graphs is extended to almost selfcomplementary graphs. We dine a p-vertex graph to be almost selfcomplementary if it is isomorphic to its complement with respect to Kp-e, the complete graph with one edge deleted. An almost selfcomplementary graph with p vertices exists if and only if p=2 or 3 (mod 4), ie., precisely when selfcomplementary graphs do not exist. We investigate various properties of almost selfcomplementary graphs and examine the similarities and differences with those of selfcomplementary graphs.</p> <p>The concepts of selfcomplementary and almost selfcomplementary graphs are combined to define so-called k-selfcomplementary graphs which include the former two classes as subclasses. Although a k-selfcomplementary graph may contain fewer edges than a selfcomplementary or an almost selfcomplementary graph it is found that the former preserves most of the properties of the latter graphs.</p> <p>The notion of selfcomplementarity is further extended to combinatorial designs. In particular, we examine whether a Steiner triple system (twofold triple system, and a Steiner system S(2,4,v), respectively) can be partitioned into two isomorphic hypergraphs.</p>"],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.other":["opendissertations/1861","3040","1356834"],"dc:identifier.uri":["http://hdl.handle.net/11375/6553","https://doi.org/10.71548/16670"],"dc:subject":["Mathematics"],"dc:title":["Almost Selfcomplementary Graphs and Extensions"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:36:30Z"}