Maximum diameter of regular digraphs

We prove that every r-biregular digraph with n vertices has its directed diamter bounded by (3n - r - 3)/(r +1). We show that this bound is tight for directed as well as for undirected graphs. The upper bound remains valid for Eulerian digraphs with minimum outdegree r. © 1929 John Wiley & Sons, Inc.