ELECTRIC CIRCUIT ANALYSIS

UNIT V
NETWORK TOPOLOGY
AND
TWO PORT NETWORK
 Overview of Unit-V
Graph Theory:
 Incidence matrix formulation Two port Network :
 Tie Set matrix formulation
 One port network
 Cut Set matrix formulation
 Impedance Parameter
Frequency Response:  Admittance Parameter
 Resonant Frequency of circuits with L  Transmission line
and C
 Quality Factor  Hybrid Parameter and
 Bandwidth-Frequency and Magnitude  Their inter- relationship
scaling
 Graph Theory
Circuit → Network
Any interconnection of passive and active elements
Types
1. Combination of Passive elements only
2. Combination of Passive and active elements only
 Network topology is a graphical representation of electric circuits.
 It is useful for analyzing complex electric circuits by converting them into network graphs.
 Network topology is also called as Graph theory or Network Graph.

 It is useful for analyzing complex electric circuits by converting them into network graphs.

 To determine Various Responses, by Writing equations and Solving equations for unknown variables
 Network Graph
The description of networks in terms of their geometry is referred to as network topology.
The adequacy of a set of equations for analyzing a network is more easily determined
topologically than algebraically.

Graph (or linear graph): A network graph is a network in which all nodes and loops are
retained but its branches or links are represented by lines.
 Steps to obtain Network graph or Graph
Replace the passive elements and sources with links.
The voltage sources are replaced by short circuits and current sources are replaced
by open circuits.
 Draw network graph for the circuit given

Observations
Solution:
 The number of nodes present in a graph will be
Step 1 – mark the nodes equal to the number of principal nodes present in an
electric circuit.
Step 2 – position the nodes with numbers  The number of branches present in a graph will be
Step 3 – Add links to it less than or equal to the number of branches present
in an electric circuit.
Types of Graphs  Unconnected Graph
 Connected Graph If there exists at least one node in the graph that
 Unconnected Graph remains unconnected by even single branch, then it is
 Directed Graph called as an unconnected graph.
 Undirected Graph  Directed Graph or oriented graph
If all the branches of a graph are represented with
 Connected Graph arrows, then that graph is called as a directed graph.
If there exists at least one branch between any These arrows indicate the direction of current flow in
of the two nodes of a graph, then it is called as each branch.
a connected graph.  Undirected Graph or un-oriented graph
If the branches of a graph are not represented with
arrows, then that graph is called as an undirected
graph.
 Problem 2: Draw oriented graph for the following network

Solution:
Step 1 – mark the nodes ( No of Nodes = 4)
Step 2 – position the nodes with numbers
Step 3 – Add links to it
Draw oriented graph

Draw Network graph

 Sub graph and its Types
 A part of the graph is called as a sub graph.
 Sub graphs are got by removing some nodes and/or branches of a given graph.
 The number of branches and/or nodes of a sub graph will be less than that of the original graph.
 A sub graph is a subset of a graph.
Types of sub graphs
 Tree
 Co-Tree
Tree:
The Tree contains all the nodes of a graph, provided, there should not be any loop in it. The branches of
a tree are called as twigs. Number of twigs = n -1.
Co-Tree:
Co-Tree is formed with the branches that are removed while forming a Tree. It is called as
Complement of a Tree. For every Tree, there will be a corresponding Co-Tree. Its branches are called as
links or chords. The links are represented with dotted lines. Number of links = ( b - n) + 1
 Relation between nodes, links, and branches
Let
B = Total number of branches in the graph or network
N = total nodes
L = link branches
Then N − 1 branches are required to construct a tree because the first branch chosen
connects two nodes and each additional branch includes one more node. Therefore
number of independent node pair voltages = N − 1 = number of tree branches.
Then
L = B − (N − 1) = B − N + 1
Number of independent loops = B − N + 1
Draw possible Trees and co-trees for the given
graph
Draw Tree for the following Graph
Incidence Matrix

 Incidence matrix is that matrix which represents the graph such that with the help of that matrix we
can draw a graph.
 This matrix can be denoted as [A].
 As in every matrix, there are also rows and columns in incidence matrix [A].

 The rows of the matrix [A] represent the number of nodes (n) and the column of the matrix [A]
represent the number of branches (m) in the given graph.
branches
nodes

(n X m) Matrix
Steps to Construct Incidence Matrix

 The entries of incidence matrix is always -1, 0, +1.

 This matrix is always analogous to KCL (Kirchhoff Current Law).
 Thus from KCL we can derive that,

1. If a given kth node has outgoing branch, then we will write +1.

2. If a given kth node has incoming branch, then we will write -1.
3. Rest other branches will be considered 0.
Example of Incidence Matrix
Type of branch Value
Outgoing branch from kth node +1
Incoming branch to kth node -1
Others 0

Branches
Nodes a b c d e f

1 +1 -1 0 0 +1 0
2 -1 0 -1 0 0 -1
3 0 0 0 +1 -1 +1
No of Nodes : 4 4 0 +1 +1 -1 0 0
No of Branches : 6
Size of incidence matrix : [ 4 x 6 ]
Reduced Incidence Matrix

 If from a given incidence matrix [A], any arbitrary row is deleted, then the new matrix formed will be
reduced incidence matrix. It is represented by symbol [Ar].
 The order of reduced incidence matrix is (n-1) × b where n is the number of nodes and b is the number
of branches.

Incidence matrix [A]

Reduced Incidence Matrix [Ar]
Branches
Nodes a b c d e f Branches
Nodes a b c d e f
1 +1 -1 0 0 +1 0
2 -1 0 -1 0 0 -1 1 +1 -1 0 0 +1 0
3 0 0 0 +1 -1 +1 2 -1 0 -1 0 0 -1
4 0 +1 +1 -1 0 0 3 0 0 0 +1 -1 +1
Obtain reduced incidence matrix Step 1: To obtain Incidence matrix [A]
from the given graph.

Step 2: Reduced Incidence Matrix [Ar]

 Key Points

 For checking correctness of incidence matrix which we have drawn, we should check sum of column.
 If sum of column comes to be zero, then the incidence matrix which we have created is correct else
incorrect.
 The incidence matrix can be applied only to directed graph only.
 The number of entries in a row apart from zero tells us the number of branches linked to that node.
This is also called as degree of that node.
 The rank of complete incidence matrix is (n-1), where n is the number of nodes of the graph.
 The order of incidence matrix is (n × b), where b is the number of branches of graph.
 From a given reduced incidence matrix we can draw complete incidence matrix by simply adding
either +1, 0, or -1 on the condition that sum of each column should be zero.
 Cut Set Matrices

 A cut-set is a minimum set of branches of a connected graph such that when removed these branches
from the graph, then the graph gets separated into 2 distinct parts called sub-graphs.
 The cut set matrix is the matrix which is obtained by row-wise taking one cut-set at a time. The cutset
matrix is denoted by symbol [Qf]
 Fundamental cut set of a given graph with reference to a tree is a cut-set formed with one twig and
remaining links. Twigs are the branches of tree and links are the branches of co-tree.
Steps to Draw Cut Set Matrix

1. Draw the graph of given network or circuit (if given).

2. Then draw its tree. The branches of the tree will be twig.
3. Then draw the remaining branches of the graph by dotted line. These branches will be links.
4. Each branch or twig of tree will form an independent cut-set. Branches
Cut sets a b c d e f
5. Write the matrix with rows as cut-set and column as branches.

C1
Orientation in Cut Set Matrix C2
1. Qij = 1; if branch J is in cut-set with orientation same as
that of tree branch. Cn
2. Qij = -1; if branch J is in cut-set with orientation
opposite to that of branch of tree.
3. Qij = 0; if branch J is not in cut-set.
Draw the cut-set matrix for the Step 2: Now identify the cut-set. Cut-set will be that node which will
following graph. contain only one twig and any number of links.

Type of branch Value

Same orientation +1
Opposite orientation -1
Others 0
Step 1: Draw the tree

Branches
Step 3: Now draw the matrix. 1 2 3 4 5
Cut sets

C1 +1 +1 -1 -1 0
C5 0 +1 0 -1 +1
 Tie set or Fundamental Loop

 Tie set is a set of branches contained in a loop.

 Each loop consists of a tree and a link or chord.
 
 Tree doesn't contain any closed path or loop.
 The link is added in a tree in order to join two nodes to form a closed path.
 This closed path is called fundamental loop.
 The number of fundamental loops of this graph will be (b - n).
    = 0   (KVL)    
Where   is an  matrix called the fundamental loop matrix or tie-set matrix
Steps to Draw Tie Set Matrix

1. Draw the graph of given network or circuit (if given).

2. Then draw its tree. The branches of the tree will be twig.
3. Then draw the remaining branches of the graph by dotted line. These branches will be links.
4. Each links of co-tree will form Tie set or fundamental loop. Branches
Tie sets a b c d e f
5. Write the matrix with rows as Tie -set and column as branches.

L1
 Orientation in Tie Set Matrix L2
1. = 1; if branch J is in tie-set with orientation same as
that of fundamental loop. Ln
2. = - 1; if branch J is in tie-set with orientation opposite as
that of fundamental loop.
3. = 0; if branch J is not in Tie-set.
Draw the Tie-set matrix for the Step 2: Now identify the tie-set. Tie-set will be that node which will
following graph. contain only one link and any number of twigs.

Type of branch Value

Same orientation +1
Opposite orientation -1
Others 0
Step 1: Draw the tree
Branches
Tie sets (loops) 1 2 3 4 5 6
Step 3: Now draw
the matrix.
L1 +1 +1 0 0 +1 0
L2 0 -1 +1 +1 0 0
L3 +1 0 +1 0 0 +1
Draw the Tie-set matrix for the Step 2: Now identify the tie-set. Tie-set will be that node which will
following graph. contain only one link and any number of twigs.

Type of branch Value

Same orientation +1
Opposite orientation -1
Others 0
Step 1: Draw the tree

Branches
Tie sets (loops) 1 2 3 4 5 6 7 8
Step 3: Now draw
the matrix.
L1 +1 0 0 0 +1 +1 0 +1
L2 0 +1 0 0 0 -1 +1 0
L3 0 0 +1 +1 0 0 -1 -1