如果图G的每个最小限制边割都孤立出一条边,则称G是超级-λ′的.本文给出了直径为2的图是超级-λ′的一个充分条件.
A graph G is super-λ′if every minimum restricted edge-cut isolates an edge. A sufficient condition for the super-λ′-connectedness is presented for a graph of diameter 2.