Premium
Unilaterally connected large digraphs and generalized cycles
Author(s) -
Gómez José,
Canale Eduardo A.,
Muñoz Xavier
Publication year - 2003
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.10095
Subject(s) - mathematics , combinatorics , bipartite graph , digraph , upper and lower bounds , order (exchange) , degree (music) , strongly connected component , discrete mathematics , graph , mathematical analysis , physics , finance , acoustics , economics
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. © 2003 Wiley Periodicals, Inc.