@Article{Bunge2018,
author = "Bunge, Ryan C. and DeShong, Steven and El-Zanati, Saad I. and Fischer, Alexander and Roberts, Dan P. and Teng, Lawrence",
title = "The spectrum problem for digraphs of order 4 and size 5",
journal = "Opuscula Math.",
year = "2018",
volume = "38",
number = "1",
pages = "15--30",
doi = "https://doi.org/10.7494/OpMath.2018.38.1.15",
url = "https://doi.org/10.7494/OpMath.2018.38.1.15",
abstract = "The paw graph consists of a triangle with a pendant edge attached to one of the three vertices. We obtain a multigraph by adding exactly one repeated edge to the paw. Now, let \(D\) be a directed graph obtained by orientating the edges of that multigraph. For 12 of the 18 possibilities for \(D\), we establish necessary and sufficient conditions on \(n\) for the existence of a \((K^{*}_{n},D)\)-design. Partial results are given for the remaining 6 possibilities for \(D\).",
keywords = "spectrum problem, digraph decompositions",
issn = "1232-9274"
}