Distance and size in digraphs

We determine the maximum number of arcs in an Eulerian digraph of given order and diameter. Our bound generalises a classical result on the maximum number of edges of an undirected graph of given order and diameter by Ore (1968) and Homenko and Ostroverhii˘ (1970). We further determine the maximum size of a bipartite digraph of given order and radius.