What is Network Topology
Network topology is arrangement of various elements
(links, nodes ,etc.) of a electrical network such that
there is no distinction between different types of physical
elements of network. Instead this study is based on a
geometric pattern of a network.
Why we need to learn Network Topology
When a circuit is non planar or complicated with large
number of nodes and closed paths, then conventional
methods like KCL , KVL , Nodal analysis, Mesh analysis
etc becomes highly difficult. Analysis of such networks
can be done conveniently using network topology.
Where do we apply Network Topology
Network topology is used to analyze voltage and currents
across various branches of an electrical circuit (more
particularly complicated circuit)
Node
Essential Node
Branch
Loop
Mesh
Graph
h i
j k
Definition Number Example
present
Node A node is a point in a circuit where two or 07 a,b, c, d, e, f and g
more circuit elements join . The number of
branches incident to that node is the degree
of its node
Essential Node A node that joins three or more elements. 04 b, c,e and g
(Junction)
Branch A single path containing one circuit element 10 V1,R1,R2,R3,V2,R4,R5,R6,R7
that connects one node to other and is and I
represented by solid line
Loop A loop is a closed path, i.e., it starts at a 11 abhikjgfca ,abhjgfca,abegfca
selected node, traces a set of connected basic abedca,cdegfc
circuit elements and returns to the original cdebhikjgfc ,cdebhjgfc
starting node without passing through any gebhjg ,jhik,abhjgedca,
intermediate node more than once. abhikjgedca
Mesh A mesh is a special type of loop which does 04 abedca,cdegfc, gebhjg ,jhik
not contain any other loops within it.
Graph A graph corresponding to a given network is
obtained by replacing all circuit elements with
lines
• Graph & Oriented Graph
1 • Rank of graph
• Planar and non planar graph
2 • Path & Sub graph
• Tree & twigs
3 • Co tree & Links(chords)
Graph ,Oriented Graph & Rank of a graph
Graph : A graph corresponding to a given network is obtained by
replacing all circuit elements with lines.
Rank of a Graph : If there are ‘n’ nodes in a graph then rank of
the of the graph is (n-1)
Oriented Graph: If each of the line/branch of the graph has a
reference direction [as indicated by an arrow
mark],then the resulted graph is called oriented
or directed graph.
Steps for drawing oriented graph:
1.Replace all resistors , inductors and capacitors by line segments
2.Replace voltage source by short circuit and current sources by open circuit
3.Assume directions of branch currents
4. Name all the nodes and branches
Planar and non - planar graph
Planar Graph : A graph drawn on a 2 - dimensional plane is said to
be planar if two branches do not intersect or cross
at a point which is other than a node .
Non Planar Graph : A graph drawn on a 2 - dimensional plane is
said to be planar if two branches intersect or cross
at a point which is other than a node .
Path and sub graph
Path : A set of elements that may be traversed in order without
passing through the same node twice.
Sub Graph : It is a sub set of branches and nodes of a graph. It is a
proper sub-graph if it contains branches and nodes less than those
on a graph. A sub graph can be just a node or only one branch of
the graph.
Tree and Twigs of graph
Tree & Twigs : A connected sub graph having all the nodes of a graph
without any loop is called a tree and branches of a tree are
called twigs.
Properties of Tree
. There exists only one path between any pair of nodes in a tree
A tree contains all nodes of the graph
If n is the number of nodes of the graph, there are (n-1)
branches in the tree
Tree do not contain any loops
Every connected graph has at least one tree
Number of possible trees of a graph = A𝐴𝑇
Identify Trees in the graph
Example 1
Co tree and Links of graph
Links or chord
- The branches that are removed from the graph while forming a
tree are termed as links or chords
- Links are complement of twigs.
Co - tree
- The graph constituted with links is known as co-tree.
1 • Complete Incidence Matrix (𝐴𝑎 )
2 • Incidence Matrix(A)
3 • Tie-set Matrix (B)
4 • F-Cut-set Matrix (Q)
a 4 b 5 c
> >
>
2 3
1 6
d
Complete Incident Matrix (Aa) Incident Matrix (A)
Tie set Matrix (B)
F-Cut set Matrix (Q)
Example 1 : For the circuit shown draw the oriented graph and write
1. Incidence Matrix
2. Tie set matrix
3. F-Cut set matrix
Solution
Oriented Graph
*** construct tree using twigs 1 and 2
Example 2 : For the circuit shown draw the oriented graph and write
1. Incidence Matrix
2. Tie set matrix
3. F-Cut set matrix
Oriented Graph
***Construct tree using twigs 6,1,3,5
Solution
Basic Incidence Matrix Aa
By Eliminating last row we get the Incidence Matrix A
Example 3 : For the graph of circuit shown draw the oriented graph and write
1. Incidence Matrix
2. Tie set matrix
3. F-Cut set matrix
***Construct tree using twigs 4,5,6
Solution
Example 4 : For the graph of circuit shown draw the oriented graph and write
1. Incidence Matrix
2. Tie set matrix
3. F-Cut set matrix
***Construct tree using twigs 1,2,3,4
Solution
Matrix Notati Definition of MATRIX Orientation of Elements Properties
Name on
Incide A The incidence matrix of this Aij = 1, if branch j is associated
with node i and oriented away The sum of the entries in
nce directed graph has one column from node i. any column is zero.
for each node of the graph and
Matrix one row for each edge of the Aij = –1, if branch j is associated The determinant of the
graph: with node i and oriented towards incidence matrix of a
Branches Node i. closed loop is zero.
The rank of incidence
<--Nodes
⋯ Aij = 0, if branch j is not matrix of a connected
⋮ ⋱ ⋮ associated with node i. graph is (n–1).
⋯
nxb
Tie B Tie-Set is a set of branches Number of tie sets in
contained in a loop such that each Bij=1 if branch j is in loop I and a tree is equal to the
set loop contains one link or chord and their orientations coincide number of links of
Matrix the remainder are tree branches. the tree
Bij=-1,if branch j is in loop I and As tie set traces a
Branches their orientations do not Coincide.
loop it is used
<--- Tie sets
⋯
⋮ ⋱ ⋮ Bij=O, if branch j is not in loop i. conveniently to apply
⋯ KVL
lxb
F Cut- Q A fundamental cut-set (FCS) is a A cut-set divides the
cut-set that cuts or contains one Qij = 1, if branch j is in the cut- set of nodes into two
set and only one tree branch. set i and the orientations
subsets.
Matrix coincide.
Therefore, for a given tree, the
number of fundamental cut-sets Qij = –1, if branch j is in the Each fundamental
will be equal to the number of cut-set i and the orientations do cut-set contains one
twigs. Branches not coincide. tree-branch, the
-- Cut sets
⋯ remaining elements
Qij = 0, if branch j is not in the
⋮ ⋱ ⋮ being links.
cut-set i.
⋯ txb
MATRIX KCL KVL
Incidence Matrix
(A)
A X Ib = 0 Vb = 𝐴𝑇 x Vn
Tie set Matrix(B)
Ib = 𝐵 IL 𝑇 B X Vb = 0
Cut set Matrix (Q)
Q X Ib = 0 V b = 𝑄 𝑇 x Vt
Vb = Branch voltage Matrix
Ib = Branch currents
Vt = Twig Voltage Matrix
IL = Loop Current Matrix
Vn = Node Voltage Matrix
Example 1 : Write the
1. Incidence Matrix of the graph
2. Express Branch voltages in terms of loop voltage
3. Write Tie set Matrix
4. Express branch currents in terms of loop current
(8)
(6)
** Use tree 5,2,3,7
1. Incidence Matrix
2. Branch voltages s in terms of node voltage
3. Tie set Matrix
4. Branch currents in terms of loop current
Example 2 : Write the f- cut set Matrix for the graph shown
taking 1,2,3,4 as tree branches. Write down the network
equations from the f cut set matrix
Solution
