Unilaterally connected large digraphs and generalized cycles
Lower and upper bounds on the order of digraphs and generalized p-cycles with a specified maximum degree and unilateral diameter are given for generic values of the parameters. Infinite families of digraphs attaining the bounds asymptotically or even exactly are presented. In particular, optimal results are proved for bipartite digraphs (p = 2) and digraphs with unilateral diameter 3. (C) 2003 Wiley Periodicals, Inc.
(delta, d)-problem unilaterally connected digraph moore digraphs