On Moore bipartite digraphs
β
M. A. Fiol; J. Gimbert; J. GΓ³mez; Y. Wu
π
Article
π
2003
π
John Wiley and Sons
π
English
β 154 KB
## Abstract In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Mooreβlike bound in terms of its diameter __k__ and the maximum outβdegrees (__d__~1~, __d__~2~) of its partite sets of vertic