J4 ›› 2012, Vol. 25 ›› Issue (2): 1-7.doi: 10.3976/j.issn.1002-4026.2012.02.001
• Content • Next Articles
GAO Jing-Zhen, SHAO Guang-Feng
Received:
Online:
Published:
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
CLC Number:
O157.5
GAO Jing-Zhen, SHAO Guang-Feng. Neighborhood conditions of maximally local edge connected and super local edge connected bipartite digraphs[J].J4, 2012, 25(2): 1-7.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.sdkx.net/EN/10.3976/j.issn.1002-4026.2012.02.001
https://www.sdkx.net/EN/Y2012/V25/I2/1
Cited