Circuit Analysis

15EECC201

Unit: II
Chapter No: 04
Network Topology

Dr Sujata Sanjay Kotabagi

4-11-20 School Of ECE 1

Network Topology
Network topology is a graphical representation of electric circuits. It is useful for analyzing complex electric circuits by
converting them into network graphs.

In network topology only the geometrical structure of the network is considered whereas the different network
elements either passive or active are not considered.

While drawing the geometrical structure(called as graph)of a given network, a Voltage source is considered as
SHORT-CKT & Current source as an OPEN-CKT

Basic Terminologies

Graph: Network graph is simply called as graph. It consists of a set of nodes connected by branches.

Any electric circuit or network can be converted into its equivalent graph by replacing the
passive elements and voltage sources with short circuits and the current sources with open
circuits

4-11-20 School Of ECE- 2

Network Topology
Let us consider the following electric circuit.

No. of Nodes(n): 4 those are labeled with 1, 2, 3, and 4

No. of Branches (b): 7

An equivalent graph:
No. of Nodes: 4 those are labeled with 1, 2, 3, and 4 respectively.
No. of Branches: 6 those are labeled a, b, c, d, e & f respectively.

We got one branch less in the graph because the 4 A current

source is made as open circuit, while converting the electric
circuit into its equivalent graph.

School Of ECE- 3
4-11-20
Network Topology
Oriented Graph: If all the branches of a graph are represented with direction
of current flow , then that graph is called as a Directed graph or oriented graph.

Tree: Tree is a connected sub graph of a given graph, which contains all the nodes of a graph.
But, there should not be any loop in that sub graph.
The branches of a tree are called as twigs.

This connected sub graph contains all the four nodes of the
given graph and there is no loop. Hence, it is a Tree.

From the above Tree, we can conclude that the number of

branches that are present in a Tree should be equal to n - 1 where
‘n’ is the number of nodes of the given graph.

School Of ECE- 4
4-11-20
 Network Topology
Co-Tree: Co-Tree is a sub graph, which is formed with the branches that are removed while forming a Tree.
Hence, it is called as Complement of a Tree.

For every Tree, there will be a corresponding Co-Tree and its branches are called as links.
In general, the links are represented with dotted lines. They may or may not form the loop

The Co-Tree corresponding to the above Tree is shown

This Co-Tree has only three nodes instead of four nodes of the
given graph, because Node 4 is isolated from the above Co-
Tree

This Co-Tree has three branches and they form a loop.

School Of ECE- 5
4-11-20
Network Topology
Co-Tree:
The number of branches that are present in a co-tree will be equal to the difference between the number of branches
of a given graph and the number of twigs. Mathematically, it can be written as

Where,
l is the number of links.
b is the number of branches present in a given graph.
n is the number of nodes present in a given graph.

If we combine a Tree and its corresponding Co-Tree, then we will

get the original graph as shown.

School Of ECE- 6
4-11-20
 Network Topology
Example

Given network Graph Oriented Graph Tree

Here, number of Nodes=N=4; Number of branches B=6

Number of Twigs(Tree branches)=N-1=3; Number of Links L=B-N+1=6-4+1=3 links(Co-tree
branches) Co-tree
4-11-20 School Of ECE- 7
 Network Topology
Draw all the possible trees for the graph shown

4-11-20 School Of ECE- 8

 Network Topology
Draw all the possible trees for the graph shown

4-11-20 School Of ECE- 9

 Network Topology
Matrices Associated with Network Graphs
Incidence Matrix:
An Incidence Matrix represents the graph of a given electric circuit or network

Hence, it is possible to draw the graph of that same electric circuit or network from the incidence matrix.

We know that graph consists of a set of nodes and those are connected by some branches. So, the connecting of branches
to a node is called as incidence.

Incidence matrix is represented with the letter An. It is also called as node to branch incidence matrix or node incidence
matrix.

If there are ‘n’ nodes and ‘b’ branches present in an oriented graph, then the incidence matrix will have ‘n’ rows and ‘b’
columns.

Here, rows and columns are corresponding to the nodes and branches of a oriented graph. Hence, the order of incidence
matrix will be n × b.

4-11-20 School Of ECE- 10

 Network Topology
Incidence Matrix:
The elements of incidence matrix will be having one of these three values, +1, -1 and 0.

 If the branch current is leaving from a selected node, then the value of the element will be +1.

 If the branch current is entering towards a selected node, then the value of the element will be -1.

 If the branch current neither enters at a selected node nor leaves from a selected node, then the value of element will be 0.

The incidence matrix

The order of this incidence matrix

is 4 × 6.

By observing the above incidence matrix, we

can conclude that the summation of column
elements of incidence matrix is equal to zero.

11
4-11-20 School Of ECE-
 Network Topology
Reduced Incidence Matrix:

Any node of a connected graph can be selected as a reference node.

The matrix obtained from An by deleting the row corresponding to the reference node is the element bus incident
matrix A and is called bus incidence matrix with dimension (N − 1) × B.

Note that the sum of elements of each column in A need not be zero.
In An, the sum of all elements in each column is zero. This leads to an important conclusion that if one row is not known
in A, it can be found so that sum of elements of each column must be zero.

Another important property of A is that determinant AAT gives the number of possible trees of the network.

12
4-11-20 School Of ECE-
 Network Topology
Reduced Incidence Matrix:

13
4-11-20 School Of ECE-
 Network Topology
1. Refer the network shown ,Obtain the corresponding incidence matrix and Reduced Incidence Matrix.

14
4-11-20 School Of ECE-
 Network Topology
2. Refer the circuit shown, Draw the graph, one tree and its co-tree.

15
4-11-20 School Of ECE-
 Network Topology
3. For the incidence matrix shown below, draw the graph.

16
4-11-20 School Of ECE-
 Network Topology
Fundamental Loop Matrix or Tie-set Matrix

Fundamental loop or f-loop is a loop, which contains only one link and one or more twigs. So, the number of f-loops
will be equal to the number of links

This matrix gives the relation between branch currents and link currents.

The elements of fundamental loop matrix will be having one of these three values, +1, -1 and 0.

The value of element will be +1 for the link of selected f-loop.

The value of elements will be 0 for the remaining links and twigs, which are not part of the selected f-loop.

If the direction of twig current of selected f-loop is same as that of f-loop link current, then the value of element will be +1.

If the direction of twig current of selected f-loop is opposite to that of f-loop link current, then the value of element will be
-1.

17
4-11-20 School Of ECE-
 Network Topology
Procedure to find Tie-set Matrix

Select a tree of given directed graph.

By including one link at a time, we will get one f-loop. Fill the values of elements corresponding to this f-loop in a row of
fundamental loop matrix.

Repeat the above step for all links.

18
4-11-20 School Of ECE-
 Network Topology

Tie-set matrix of the above considered Tree will

be

Twigs: d, e & f. Links: a, b & c

The rows and columns of the above matrix represents the links and branches of given directed graph. The order of
this incidence matrix is 3 × 6.

So, the fundamental loop matrix will have ‘b-n+1’ rows and ‘b’ columns.

Here, rows and columns are corresponding to the links of co-tree and branches of given graph. Hence, the order
of fundamental loop matrix will be (b - n + 1) × b.

19
4-11-20 School Of ECE-
 Network Topology
Tie-set schedule

Column wise addition gives the relation between branch currents and link currents.
Row wise addition gives KVL equations
Eqns

20
4-11-20 School Of ECE-
 Network Topology
For the network shown, write a tie-set schedule and then find all the branch currents
and voltages. Consider 4, 5, 6 as twigs

21
4-11-20 School Of ECE-
 Network Topology
Contd

Eqns

22
4-11-20 School Of ECE-
 Network Topology
For the oriented graph shown, express loop currents in terms of branch currents. Consider 1, 2 , 3, and 4 as links

Eqns

23
4-11-20 School Of ECE-
 Network Topology
Fundamental Cut-set Matrix
The f-cut set contains only one twig and one or more links. So, the number of f-cut sets will be equal to the number of twigs.

Fundamental cut set matrix is represented with letter C. This matrix gives the relation between branch voltages and twig
voltages.

The elements of fundamental cut set matrix will be having one of these three values, +1, -1 and 0.

 The value of element will be +1 for the twig of selected f-cutset.

 The value of elements will be 0 for the remaining twigs and links, which are not part of the selected f-cutset.

 If the direction of link current of selected f-cut set is same as that of f-cutset twig current, then the value of element
will be +1.

 If the direction of link current of selected f-cut set is opposite to that of f-cutset twig current, then the value of
element will be -1.

24
4-11-20 School Of ECE-
 Network Topology
Procedure to find Fundamental Cut-set Matrix
Select a Tree of given directed graph and represent the links with the dotted lines.

By removing one twig and necessary links at a time, we will get one f-cut set. Fill the values of elements
corresponding to this f-cut set in a row of fundamental cut set matrix.

Repeat the above step for all twigs.

25
4-11-20 School Of ECE-
 Network Topology
So, the fundamental cut set matrix of the
above considered Tree will be

Links: a, b & c Twigs: d, e & f.

The rows and columns of the above matrix represents the twigs and branches of given directed graph. The order of this
fundamental cut set matrix is 3 × 6.
If there are ‘n’ nodes and ‘b’ branches are present in a directed graph, then the number of twigs present in a selected
Tree of given graph will be n-1.

So, the fundamental cut set matrix will have ‘n-1’ rows and ‘b’ columns. Here, rows and columns are corresponding
to the twigs of selected tree and branches of given graph.

Hence, the order of fundamental cut set matrix will be (n-1) × b.

26
4-11-20 School Of ECE-
 Network Topology
Cut set matrix Schedule

Links: a, b & c Twigs: d, e & f.

Eqns Column wise addition gives the relation between branch and link voltages.
Row wise addition gives KCL equations

27
4-11-20 School Of ECE-
 Network Topology
For the network shown, prepare a cut-set schedule and obtain equilibrium equations. Consider 1,2 as twigs

28
4-11-20 School Of ECE-
 Network Topology
For the network shown, prepare a cut-set schedule and obtain equilibrium equations. Consider 1,2 as twigs

Eqns

29
4-11-20 School Of ECE-
11/9/2020 School Of ECE-Prakalp18-22 30