摘要 : Edge connectivity is an important parameter for the reliability of the inter-connection network. A graph G is strong Menger edge-connected (SM-λ for short) if there exist min{deg_G(u),deg_G(ⅴ)} edge-disjoint paths between any pai... 展开 Edge connectivity is an important parameter for the reliability of the inter-connection network. A graph G is strong Menger edge-connected (SM-λ for short) if there exist min{deg_G(u),deg_G(ⅴ)} edge-disjoint paths between any pair of vertices u and v of G. The conditional edge-fault-tolerance strong Menger edge connectivity of G, denoted by sm_λ~r(G), is the maximum integer m such that G - F remains SM-λ for any edge set F with |F| ≤ m and δ(G - F) ≥ r, where δ(G - F) ≥ r is the minimum degree of G - F. Most of the previous papers discussed sm_λ~r(G) in the case of r ≤ 2. In this paper, we show that sm_λ~r(FQ_n) = 2~r(n - r + 1) - (n + 1) for 1 ≤ r ≤ n - 2, where n ≥ 4. 收起