**What is Cut Set Matrix?**

A cut-set is a minimum set of elements that when removed, separates the graph into two groups of nodes. A cut-set is a minimum collection of branches in a connected graph such that removing these branches decreases the graph's rank by one.

### Cut-Set Matrix Definition

A fundamental cut-set contains only one branch of the tree. Therefore, for a given tree, the number of fundamental cut-sets is equal to the number of twigs present. Cut-set matrix is represented by QC and is defined as a rectangular matrix whose rows correspond to cut-sets and columns correspond to the branches of a graph. The cut-set matrix can have the following values:

[Q_{ij}] = 1; if branch j is in the cut-set i and orientations coincide

[Q_{ij}] = -1; if branch j is in the cut-set i and orientations do not coincide

[Q_{ij}] = 0; if branch j is not in the cut-set i

**Procedure to Find Fundamental Cut-Sets**

To find the fundamental cut-sets and write an equivalent cut-set matrix, firstly select a tree of the graph. Fundamental cut-sets are denoted by Cn. Consider the graph shown below illustrating the fundamental cut-sets. The procedure to find the fundamental cut-sets is:

- Select one of the possible trees of the given graph.
- Focus on one particular tree branch at once.
- Check whether removing the focused branch from the tree disconnects the tree into two separate parts.
- All the links which go from one part of this disconnected tree to the other, together with the focused branch form one fundamental cut-set.
- Repeat the same for other tree branches as well to get the fundamental cut-sets.

The number of fundamental cut-sets will always be equal to the number of twigs present in the tree.

**Properties of Cut-Set Matrix**

The procedure to find the fundamental cut-sets is already discussed. There are some properties of the cut set matrix that need to be fulfilled for the validation of these fundamental cut-sets. These properties are:

- A fundamental cut-set can contain only one branch of a tree and the remaining elements are links.
- A cut-set divides the tree into two separate parts after removing the tree branch of that particular cut-set.
- Each branch of the cut-set has one of its terminal’s incidents at a node in one subset of the tree and its other terminal at a node in the other part of the tree.
- The direction of the cut-set is chosen the same as the direction of the branch current of the tree in that cut-set.

**Cut-Set Matrix and KVL**

With the cut-set matrix, the branch voltages can be expressed in terms of the tree-branch voltages. A cut-sets consists of only one branch of the tree together with any links which must be cut to divide the tree into two parts. Consider the following graph along with the tree as shown below:

Let v_{t5}, v_{t6}, v_{t7,} and v_{t8} be the tree branch voltages and V_{b1}, V_{b2}, V_{b3}, V_{b4}, V_{b5}, V_{b6}, V_{b7,} and V_{b8} be the branch voltages then,

**Cut-Set Matrix and KCL**

Consider the same graph and tree used in the cut-set matrix and KVL as mentioned below. If I_{b1}, I_{b2}, I_{b3}, I_{b4}, I_{b5}, I_{b6}, I_{b7,} and I_{b8} are the branch currents of respective branches, then, the current at node a, b, c, and d can be obtained by applying KCL as,

Important Topics for Gate Exam | |

Brittle Material | Capacitors in Parallel |

Capacitors in Series | Carnot Cycle |

Cement Test | Clamping Circuit |

Clipping Circuit | CMOS Fabrication |

CMOS Converter | Column Base |

## Comments

write a comment