{"id":{"repo_id":"etsu","oai_identifier":"oai:dc.etsu.edu:etd-5271"},"canonical_url":"https://search.ndltd.org/etd/etsu/oai:dc.etsu.edu:etd-5271","repository":{"repo_id":"etsu","name":"East Tennessee State University","base_url":"https://dc.etsu.edu/do/oai/"},"display":{"title":"Decompositions of the Complete Mixed Graph by Mixed Stars","abstract":"In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions of the complete mixed graph into partially oriented stars with twice as many arcs as edges. We employ difference methods in most of our constructions when showing suffciency. 2","abstract_html":"In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions of the complete mixed graph into partially oriented stars with twice as many arcs as edges. We employ difference methods in most of our constructions when showing suffciency. 2","abstract_has_math":false,"creators":["Culver, Chance"],"institution":"East Tennessee State University","degree_name":"MS (Master of Science)","degree_level":"Thesis - embargo","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020-08-01T07:00:00Z","date_published":"2020-08-01T07:00:00Z","updated_at":"2026-11-19T07:56:12Z","subjects":["Graph Theory","Graph Decomposition","Mixed Decomposition","Mixed Star Decomposition.","Other Mathematics"],"languages":["eng"],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/3782","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://dc.etsu.edu/etd/3782","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":"https://dc.etsu.edu/context/etd/article/5271/viewcontent/CulverC051220f.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://dc.etsu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adc.etsu.edu%3Aetd-5271","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Culver, Chance"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-09-15T07:00:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2020-08-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["East Tennessee State University"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - embargo"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["East Tennessee State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph Theory","Graph Decomposition","Mixed Decomposition","Mixed Star Decomposition.","Other Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"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/5271/viewcontent/CulverC051220f.pdf","https://dc.etsu.edu/etd/3782"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions of the complete mixed graph into partially oriented stars with twice as many arcs as edges. We employ difference methods in most of our constructions when showing suffciency. 2"]},{"key":"dc:title","label":"Title","values":["Decompositions of the Complete Mixed Graph by Mixed Stars"]}]}],"canonical_facts":{"dc:creator":["Culver, Chance"],"dc:date.available":["2021-09-15T07:00:00Z"],"dc:date.issued":["2020-08-01T07:00:00Z"],"dc:description.abstract":["In the study of mixed graphs, a common question is: What are the necessary and suffcient conditions for the existence of a decomposition of the complete mixed graph into isomorphic copies of a given mixed graph? Since the complete mixed graph has twice as many arcs as edges, then an obvious necessary condition is that the isomorphic copies have twice as many arcs as edges. We will prove necessary and suffcient conditions for the existence of a decomposition of the complete mixed graphs into mixed stars with two edges and four arcs. We also consider some special cases of decompositions of the complete mixed graph into partially oriented stars with twice as many arcs as edges. We employ difference methods in most of our constructions when showing suffciency. 2"],"dc:identifier":["https://dc.etsu.edu/context/etd/article/5271/viewcontent/CulverC051220f.pdf","https://dc.etsu.edu/etd/3782"],"dc:language":["eng"],"dc:publisher":["East Tennessee State University"],"dc:rights":["Copyright by the authors."],"dc:subject":["Graph Theory","Graph Decomposition","Mixed Decomposition","Mixed Star Decomposition.","Other Mathematics"],"dc:title":["Decompositions of the Complete Mixed Graph by Mixed Stars"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - embargo"],"thesis:degree_name":["MS (Master of Science)"],"thesis:institution_name":["East Tennessee State University"]},"updated_at":"2026-11-19T07:56:12Z"}