International

Electrotechnical

Commission

set of branches of a graph such that cutting all the branches of the set increases the number of unconnected parts of the graph, but the retention of any one branch of the set does not increase that number

Note – For the network of the figure below, two cut-sets are (2-3, 6-7) and (1-5, 2-6, 3-7, 3-4).