BEEE203L
Circuit Theory
Module : 1 Lecture : 4
Additional Problems in Incidence, Tieset & Cutset Matrices
Module : 1 – Network Topology
• Concept of
• Tree
• Branch
• Tree Link
• Incidence Matrix
• Tie-Set Matrix & loop current
• Cut-Set Matrix & Node Pair Potential
• Duality
Problem - 1
How many trees are possible for the graph of the network of Fig.
Problem - 1
How many trees are possible for the graph of the
network of Fig.
Solution:
To draw the graph,
1. replace all resistors, inductors and capacitors by line segments,
2. replace voltage source by short circuit and current source by an open circuit,
3. assume directions of branch currents arbitrarily, and number all the nodes and branches.
The oriented graph is shown in Fig.
Problem - 2
Draw the oriented graph from the complete incidence matrix given below;
Problem - 2
Draw the oriented graph from the complete incidence matrix given below;
1. Solution
2. First, note down the nodes 1, 2, 3, 4, 5 as shown in Fig.
3. From the complete incidence matrix, it is clear that the branch number 1 is
between nodes 1 and 5 and it is going away from node 1 and towards node 5
as the entry against node 1 is 1 and that against 5 is −1.
4. Hence, connect the nodes 1 and 5 by a line, point the arrow
5. towards 5 and call it branch 1 as shown in Fig.
6. Similarly, draw the other oriented branches.
Problem - 3
The reduced incidence matrix of an oriented graph is given below. Draw the graph.
Problem - 3
The reduced incidence matrix of an oriented graph is given below. Draw the graph.
Solution
First, writing the complete incidence matrix from the matrix A such that
the sum of all entries in each column of Aa will be zero, we have
Now, the oriented graph can be drawn with matrix Aa as shown in Fig.
Problem - 4
The reduced incidence matrix of an oriented graph is
(a) Draw the graph.
(b) How many trees are possible for this graph?
(c) Write the tieset and cutset matrices.
Problem - 4
The reduced incidence matrix of an oriented graph is
(a) Draw the graph.
(b) How many trees are possible for this graph?
(c) Write the tieset and cutset matrices.
Solution
(a) First, writing the complete incidence matrix Aa such that the sum of all the entries in each column of Aa
is zero, we have
(b) The number of possible trees = |AAT|
The number of possible trees = 8.
Problem - 4
The reduced incidence matrix of an oriented graph is
(a) Draw the graph.
(b) How many trees are possible for this graph?
(c) Write the tieset and cutset matrices.
Problem - 5
The fundamental cutset matrix of a network is given as follows;
Problem - 5
The fundamental cutset matrix of a network is given as follows;
Draw the oriented graph.
References
• Network Analysis & Synthesis – Ravish R. Singh, McGraw Hill Education (India) Private Limited
NEW DELHI, 2013, Chapter : 9, Section : 9.13, Pages :9.21 – 9.24.
