Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987): Difference between revisions

The diameter of any d-regular digraph with n nodes in at least \(\lceil \log_ d(n(d-1)+1)\rceil -1.\) If \(d\geq 3\) and \(n>d^ 3\) the authors construct a d-regular, d-connected digraph with n nodes and diameter at most \(\lceil \log_ dn\rceil\).