Maximum diameter of regular digraphs
José Soares · Journal of Graph Theory · 1992
Abstract We prove that everyr‐biregular digraph withnvertices 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 outdegreer. © 1929 John Wiley & Sons, Inc.