BEEE203L

Circuit Theory
Module : 1 Lecture : 3
Module : 1 – Network Topology
• Concept of
• Tree
• Branch
• Tree Link
• Incidence Matrix
• Tie-Set Matrix & loop current
• Cut-Set Matrix & Node Pair Potential
• Duality
Fundamental Circuit Matrix (Tieset)
• When a graph is given, first select a tree and
remove all the links.
• When a link is replaced, a closed loop or circuit is
formed.
• Circuits formed in this way are called fundamental
circuits or f-circuits or tiesets.
• Orientation of an f-circuit is given by the
orientation of the connecting link.
• The number of f-circuits is same as the number of
links for a graph.
• In a graph having b branches and n nodes, the
number of f-circuits or tiesets will be (b − n + 1).
• The orientation of each f-circuit is given by the
orientation of the corresponding connecting link.
Fundamental Circuit Matrix (Tieset)

f-circuit matrix or tieset matrix

• Usually, the f-circuit matrix B is rearranged so that the first (n − 1) columns correspond to the twigs
• b − (n − 1) columns correspond to the links of the selected tree.
• The matrix B can be partitioned into two matrices Bt and Bl.
Orthogonal Relationship between Matrix A and Matrix B

• For a linear graph, if the columns of the two matrices Aa and Ba are arranged in
the same order, it can be shown that

• If the reduced incidence matrix A and the f-circuit matrix B are written for the
same tree, it can be shown that
CUTSET MATRIX
• Consider a linear graph. By removing a set of branches without affecting the nodes,
two connected sub-graphs are obtained and the original graph becomes
unconnected.
• The removal of this set of branches which results in cutting the graph into two parts
are known as a cut-set.
• The cut-set separates the nodes of the graph into two groups, each being in one of
the two groups.
• Branches 1, 3 and 4 will form a cutset. This set of branches separates the graph
into two parts. One having an isolated node 4 and other part having branches 2
and 5 and nodes 1, 2 and 3.
• Similarly, branches 1 and 2 will form a cutset. Each branch of the cutset has one
of its terminals incident at a node in one part and its other end incident at other
nodes in the other parts.
• The orientation of a cutset is made to coincide with orientation of defining
branch.
CUTSET MATRIX
• For a graph having n nodes and b branches, the cutset matrix Qa is a rectangular matrix of order b columns and as
many rows as there are cutsets. Its elements have the following values:
• qij = 1, if the branch j is in the cutset i and the orientation coincide.
• = −1, if the branch j is in the cutset i and the orientations do not coincide.
• = 0, if the branch j is not in the cutset i.
• Figure shows a directed graph and its cutsets.
CUTSET MATRIX
• For the cutset 2, which cuts the branches 2, 3 and 4 and is shown by a dotted circle, the entry in the cutset
schedule for the branch 2 is 1, since the orientation of this cutset is given by the orientation of the branch 2
and hence it coincides.
• The entry for branch 3 is −1 as orientation of branch 3 is opposite to that of cutset 2, i.e., branch 2 goes into
cutset while branch 3 goes out of cutset.
• The entry for branch 4 is 1 as the branch 2 and the branch 4 go into the cutset. Thus their orientations
coincide.
• Hence, the cutset matrix Qa is given as
Fundamental Cutset and Fundamental Cutset Matrix
• When a graph is given, fi rst select a tree and note down its twigs. When a twig is removed from the tree, it separates a
tree into two parts (one of the separated part may be an isolated node).
• Now, all the branches connecting one part of the disconnected tree to the other along with the twig removed,
constitutes a cutset.
• This set of branches is called a fundamental cutset or f-cutset.
• A matrix formed by these f-cutsets is called an f-cutset matrix.
• The orientation of the f-cutset is made to coincide with the orientation of the defining branch, i.e., twig.
• The number of f-cutsets is the same as the number of twigs for a graph.
• Figure shows a graph, selected tree and f-cutsets corresponding to the selected tree.
Fundamental Cutset and Fundamental Cutset Matrix
• The branches 2, 1, and 6 are in the f-cutset 2. Orientation of f-cutset 2 is given by orientation of the branch 2
which is moving away from the f-cutset 2.
• Since the orientations of branches 2, 1 and 6 coincide with the orientation of the f-cutset 2, q11 = 1, q12 = 1
and q16 = 0. The branches 3, 4 and 5 are not in the f-cutset 2.
• Hence, q13 = 0, q14 = 0 and q15 = 0.
• Similarly, other elements of the f-cutset matrix are written.

The cutset schedule is Hence, the f-cutset matrix Q is given by

Fundamental Cutset and Fundamental Cutset Matrix
• The f-cutset matrix Q is rearranged so that the fi rst (n − 1) columns correspond to twigs and b − (n − 1)
columns to links of the selected tree.

• The matrix Q can be subdivided into matrices Qt and Ql.

• where Qt is the twig matrix, Ql is the link matrix and U is the unit matrix.
Orthogonal Relationship between Matrix B and Matrix Q

• For a linear graph, if the columns of two matrices Ba and Qa are arranged in the same order, it
can be shown that
or

• If the f-circuit matrix B and the f-cutset matrix Q are written for the same selected tree, it can be
shown that
or

• These two equations show the orthogonal relationship between matrices A and B.
Problem – 1
For the circuit shown in Fig., draw the oriented graph and write the
(a) incidence matrix, (b) tieset matrix, and (c) f-cutset matrix.

Solution For drawing the oriented graph,

• 1. replace all resistors, inductors and capacitors by line segments,
• 2. replace the voltage source by short circuit and the current source by an open circuit,
• 3. assume the directions of branch currents arbitrarily, and
• 4. number all the nodes and branches.

oriented graph
Problem – 1
For the circuit shown in Fig., draw the oriented graph and write the
(a) incidence matrix, (b) tieset matrix, and (c) f-cutset matrix.

oriented graph
References
Formation of tie-set and cut-set matrix and its application in KVL and KCL
• https://www.youtube.com/watch?v=QgOAWBPx-4g
How to find Cut-set Matrix | step by step procedure to find cutset matrix | fundamental cut set
• https://www.youtube.com/watch?v=e_EYpHtfx7o

• Network Analysis & Synthesis – Ravish R. Singh, McGraw Hill Education (India) Private Limited
NEW DELHI, 2013, Chapter : 9, Section : 9.5 & 9.6, Pages : 641 – 647.