9. Cutset(J)--a cutset of a connected graph is a set of minimum number of branches that when deleted divide the graph into two separate subgraphs.9. Cutset(割集) -- A cutset of a connected graph is a set of minimum number of branches that when deleted divide the graph into two separate subgraphs. C1 C3 C2 6