Decomposition of complete directed graphs into directed graph pairs of order 3 and 4
A Complete Directed Graph is a graph in which every vertex has an in and out degree connecting every pair of distinct vertices, creating two edged between each set of vertices one in each direction. By finding a decomposition of a Complete Directed graph (K*n) we can decompose larger graphs in order to assign them certain properties based on what decomposes them. This paper seeks to decompose complete directed graph into pairs of order 3 and some special graph pairs of order 4.
Henry, Jacob, "Decomposition of complete directed graphs into directed graph pairs of order 3 and 4" (2016). Honors Projects. 21.
This document is currently not available here.