Opuscula Math. 38, no. 1 (2018), 15-30
https://doi.org/10.7494/OpMath.2018.38.1.15

Opuscula Mathematica

# The spectrum problem for digraphs of order 4 and size 5

Ryan C. Bunge
Steven DeShong
Alexander Fischer
Dan P. Roberts
Lawrence Teng

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.

Mathematics Subject Classification: 05C20, 05C51.

Full text (pdf)