{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-3228"},"canonical_url":"https://search.dev.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-3228","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"The Last of the Mixed Triple Systems.","abstract":"<p>In this thesis, we consider the decomposition of the complete mixed graph on <em>v</em> vertices denoted <em>M<sub>v</sub></em>, into every possible mixed graph on three vertices which has (like <em>M<sub>v</sub></em>) twice as many arcs as edges. Direct constructions are given in most cases. Decompositions of the&#955;-fold complete mixed graph &#955;<em>M<sub>v</sub></em>, are also studied.</p>","abstract_html":"&lt;p&gt;In this thesis, we consider the decomposition of the complete mixed graph on &lt;em&gt;v&lt;/em&gt; vertices denoted &lt;em&gt;M&lt;sub&gt;v&lt;/sub&gt;&lt;/em&gt;, into every possible mixed graph on three vertices which has (like &lt;em&gt;M&lt;sub&gt;v&lt;/sub&gt;&lt;/em&gt;) twice as many arcs as edges. Direct constructions are given in most cases. Decompositions of the&amp;#955;-fold complete mixed graph &amp;#955;&lt;em&gt;M&lt;sub&gt;v&lt;/sub&gt;&lt;/em&gt;, are also studied.&lt;/p&gt;","abstract_has_math":false,"creators":["Jum, Ernest"],"institution":null,"degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009-08-19T07:00:00Z","date_published":"2009-08-19T07:00:00Z","updated_at":"2026-07-24T02:21:03Z","subjects":["Graceful Labelings","Mixed Wheels","Mixed Graphs","Triple Systems.","Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics"],"languages":[],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/1876","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Jum, Ernest"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2009-08-19T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graceful Labelings","Mixed Wheels","Mixed Graphs","Triple Systems.","Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/3228/viewcontent/JumE072209f.PDF","https://dc.etsu.edu/etd/1876"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>In this thesis, we consider the decomposition of the complete mixed graph on <em>v</em> vertices denoted <em>M<sub>v</sub></em>, into every possible mixed graph on three vertices which has (like <em>M<sub>v</sub></em>) twice as many arcs as edges. Direct constructions are given in most cases. Decompositions of the&#955;-fold complete mixed graph &#955;<em>M<sub>v</sub></em>, are also studied.</p>"]},{"key":"dc:title","label":"Title","values":["The Last of the Mixed Triple Systems."]}]}],"canonical_facts":{"dc:creator":["Jum, Ernest"],"dc:date.issued":["2009-08-19T07:00:00Z"],"dc:description.abstract":["<p>In this thesis, we consider the decomposition of the complete mixed graph on <em>v</em> vertices denoted <em>M<sub>v</sub></em>, into every possible mixed graph on three vertices which has (like <em>M<sub>v</sub></em>) twice as many arcs as edges. Direct constructions are given in most cases. Decompositions of the&#955;-fold complete mixed graph &#955;<em>M<sub>v</sub></em>, are also studied.</p>"],"dc:identifier":["https://dc.etsu.edu/context/etd/article/3228/viewcontent/JumE072209f.PDF","https://dc.etsu.edu/etd/1876"],"dc:rights":["Copyright by the authors."],"dc:subject":["Graceful Labelings","Mixed Wheels","Mixed Graphs","Triple Systems.","Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics"],"dc:title":["The Last of the Mixed Triple Systems."],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"]},"updated_at":"2026-07-24T02:21:03Z"}