A Mixed Graph Achieving A Moore-like Bound

Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper we construct a mixed cage of order 30 that achieves the mixed graph analogue of the Moore bound for degree 3, out-degree 1, and girth 6.