From reference (1), p. 270:
A set of nodes is a lambda-set if any pair of nodes in the lambda set has
larger edge connectivity than any pair of nodes consisting of one node from
within the lamda set and a second node from outside the lamda set.As stated in reference (2), a lambda set is a maximal subset of nodes who have
more edge-independent paths connecting them to each other than to outsiders.
A lambda set could be characterized by the minimum edge connectivity k
among its members, and could be called lambda-k
sets.
Let N be maximum edge connectivity of graph g
,
we output all the lambda-k set for all k = 1, ..., N.