中文摘要：

限制边连通度是度量网络可靠性的重要参数。设G是一个边集为E的连通网络。称一个边集合S.E是一个限制边割，如果G-S是不连通的且每个分支至少有两个顶点。网络G的限制边连通度，记为λ'，定义为G的最小限制边割的基数。设d(v)表示顶点v的度，ξ=min{d(u)+d(v)-2:uv∈E}表示G的最小边度。称网络G是极大限制边连通的，如果λ'=ξ。给出了网络是极大限制边连通的一些充分条件。

英文摘要：

The restricted edge connectivity is an important index to measure the reliability of networks.For a connected network G with edge set E,an edge set S?E is a restricted edge cut if G-S is disconnected and every component of G-S has at least two vertices.The restricted edge connectivity of G,denoted byλ',is defined as the cardinality of a minimum restricted edge cut.Let d(v)be the degree of a vertex v and letξ=min{d(u)+d(v)-2:uv∈E}be the minimumedge degree of G.A connected network G is maximally restricted edge-connected ifλ'=ξ.In this paper,some sufficient conditions are presented for networks to be maximally restricted edge-connected