The asymptotic number of acyclic digraphs. II (Q1108287)

[For part I see the paper of the first author, \textit{L. B. Richmond}, the second author and \textit{N. C. Wormald} in Combinatorica 6, 15-17 (1986; Zbl 0601.05025).] The authors consider generalized de Bruijn graphs \(G_ B(n,d)\) and \(G_ I(n,d)\). These graphs have vertices labelled 0,1,...,n-1 and there is an arc from vertex i to vertex j in \(G_ B(n,d)\) if \(j\equiv di+r(mod n)\) where \(0\leq r\leq d-1\) and from vertex i to vertex j in \(G_ I(n,d)\) if \(j\equiv d(n-1-i)+r(mod n)\) where \(0\leq r\leq d-1\). Various properties of these graphs are established pertaining to, in particular, their vertex and edge connectivities and their diameters.