Multidecompositions of Complete Directed Graphs into Directed Graph Pairs
Submission Type
Event
Faculty Advisor
Daniel Roberts
Expected Graduation Date
2020
Location
Room E105, Center for Natural Sciences, Illinois Wesleyan University
Start Date
4-13-2019 11:00 AM
End Date
4-13-2019 12:00 PM
Disciplines
Education
Abstract
A directed graph is a way to encode information about directional relationships among objects. The complete directed graph on n objects is the directed graph with arrows pointing in both directions for each pair of objects. In this project we are interested in decomposing complete directed graphs into pairs of smaller directed graphs. In particular, we choose to focus on directed graphs pairs. A directed graph pair is two directed graphs that together form a smaller complete directed graph.
Multidecompositions of Complete Directed Graphs into Directed Graph Pairs
Room E105, Center for Natural Sciences, Illinois Wesleyan University
A directed graph is a way to encode information about directional relationships among objects. The complete directed graph on n objects is the directed graph with arrows pointing in both directions for each pair of objects. In this project we are interested in decomposing complete directed graphs into pairs of smaller directed graphs. In particular, we choose to focus on directed graphs pairs. A directed graph pair is two directed graphs that together form a smaller complete directed graph.