2019•Digital Commons at Illinois Wesleyan University (Illinois Wesleyan University)Requires access
Multidecompositions of Complete Directed Graphs into Directed Graph Pairs
Patrick J. Ward
Open publisher page 0 citations
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.