图是超级限制边连通的一个充分条件

A graph——the sufficient conditioon of super restricted edge-connectivity

图的超级限制边连通性是度量计算机互连网络可靠性(容错性)的一个重要参数。本文通过考虑图的超级限制边连通性,得到如下结论:若G是n(>7)阶不含三角形的图且对任一对不相邻的顶点x与y有d(x)+d(y) n-1,则G是超级限制边连通的,即super-λ′的。

The super restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of interconnection networks. In this paper, the super restricted edge-connectivity of a graph is considered,and we obtain the following results:be G is a graph of n(>7) order having not any triangle and is d(x)+d(y)n-1 for any pair of nonadjacent vertices x and y,G is super restricted edge-connected,or super-λ′.