The complete symmetric directed graph of order v, denoted Kv∗, is the directed graph on v vertices that contains both arcs (x,y) and (y,x) for each pair of distinct vertices x and y. For a given directed graph, D, the set of all v for which Kv∗ admits a D-decomposition is called the spectrum of D. There are 10 non-isomorphic orientations of a 7-cycle (heptagon). In this paper, we completely settled the spectrum problem for each of the oriented heptagons.
@article{arxiv.2003.11187,
title = {Decompositions of Complete Symmetric Directed Graphs into the Oriented Heptagons},
author = {Uğur Odabaşı},
journal= {arXiv preprint arXiv:2003.11187},
year = {2020}
}