A cut set is a set of branches. It is a set of branches that pass through the closed surface after dividing the graph into two parts. If any one of the branches is removed, the graph will return. Connectivity will be restored.
A cut set contains at least one tree branch, or more than one tree branch. A cut set containing only one tree branch is called a single-tree branch cut set. This concept is very important and is used in circuit analysis.