BEEE203L
Circuit Theory
Module : 1 Lecture : 2
Module : 1 – Network Topology
• Concept of
• Tree
• Branch
• Tree Link
• Incidence Matrix
• Tie-Set Matrix & loop current
• Cut-Set Matrix
• Node Pair Potential
• Duality
Steps for drawing the directed graph,
1. replace all resistors, inductors and capacitors by line segments,
2. replace the voltage source by a short-circuit,
3. assume directions of branch currents, and
4. number all the nodes and branches.
Graph of a Network
Draw directed graph of the networks shown in Fig.
Graph - Tree
Figure shows a graph of the network. Show all the trees of this graph.
Graph - Tree
Figure shows a graph of the network. Show all the trees of this graph.
Incidence Matrix
Complete Incidence Matrix (Aa)
Reduced Incidence Matrix (A)
Incidence Matrix
Complete Incidence Matrix (Aa)
For a graph with n nodes and b branches, the complete incidence matrix is a rectangular matrix of order n × b.
Elements of this matrix have the following values:
aij = 1, if branch j is incident at node i and is oriented away from node i.
= −1, if branch j is incident at node i and is oriented towards node i.
= 0, if branch j is not incident at node i.
The complete incidence matrix is
It is seen from the matrix Aa that the sum of the elements in any column is zero.
Hence, any one row of the complete incidence matrix can be obtained by the algebraic manipulation of other rows.
Incidence Matrix
Reduced Incidence Matrix (A)
• The reduced incidence matrix A is obtained from the complete incidence matrix
Aa by eliminating one of the rows. It is also called incidence matrix.
• It is of order (n − 1) × b.
• Eliminating the third row of matrix Aa,
Reduced Incidence Matrix (A)
When a tree is selected for the graph as shown in Fig., the incidence matrix is
obtained by arranging a column such that the fi rst (n − 1) column corresponds to
twigs of the tree and the last b − (n − 1) branches corresponds to the links of the
selected tree.
Number of Possible Trees of a Graph
Find the No. of Possible Trees = ??
LOOP MATRIX OR CIRCUIT MATRIX
• When a graph is given, it is possible to tell which branches constitute which loop or circuit.
• Alternately, if a loop matrix or circuit matrix is given, we can reconstruct the graph.
LOOP MATRIX OR CIRCUIT MATRIX
