Abstract:

We prove that a n-order bipartite digraph D is maximally local-edge-connected if the minimum degree δ≥3 and min (N+(x)∪N+(y)|，|N-(x)∪N-(y)|}≥(n+3)/4 for each pair of vertices x and y  in the same part, and is super-edge-connected if δ≥4 and min{N⁺(x)∪N⁺(y)|,|N^-(x)∪N^-(y)|}>(n/4)+1 for each pair of vertices and y in the same part. We also prove that the best possibility of the conditions and the independence of the results  from the primitive ones.

Key words: bipartite digraph, neighborhood condition, minimum degree, maximal local-edge-connectivity, super-local-edge-connectivity