In this paper we consider the problem of characterizing directed graphs of specified diameter. We are especially interested in the minimal number of arcs required to construct a directed graph on vertices with diameter . Classes of graphs considered include general digraphs, digraphs without cycles of length , and digraphs with regular indegree or regular outdegree. Upper bounds are developed in cases where the exact solutions are not known.
