Question

define fundamental cut sets and cycles with example ​

Answer 1

The fundamental cut sets of a connected graph G of e edges. and v vertices, with respect toa tree, are the v. 1 minimal cut sets, one for each. branch, in which each cut set includes exactly one branch of T.