Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

MODULE 1
NETWORK TOPOLOGY
The solution of a given linear network problem requires the formation of a set of equations
describing the response of the network. The mathematical model so derived, must describe the
characteristics of the individual network components, as well as the relationship which governs
the interconnection of the individual components. In the bus frame of reference the variables
are the node voltages and node currents. The independent variables in any reference frame can
be either currents or voltages. Correspondingly, the coefficient matrix relating the dependent
variables and the independent variables will be either an impedance or admittance matrix. The
formulation of the appropriate relationships between the independent and dependent variables
is an integral part of a digital computer program for the solution of power system problems.
The formulation of the network equations in different frames of reference requires the
knowledge of graph theory. Elementary graph theory concepts are presented here, followed by
development of network equations in the bus frame of reference.

NETWORK TOPOLOGY:
The geometrical interconnection of the various branches of a network is called the topology of
the network.
The connection of the network topology, shown by replacing all its elements by lines is called
a graph. A linear graph consists of a set of objects called nodes and another set called elements
such that each element is identified with an ordered pair of nodes.
An element is defined as any line segment of the graph irrespective of the characteristics of the
components involved.
A graph in which a direction is assigned to each element is called an oriented graph or a
directed graph. It is to be noted that the directions of currents in various elements are arbitrarily
assigned and the network equations are derived, consistent with the assigned directions.
Elements are indicated by numbers and the nodes by encircled numbers. The ground node is
taken as the reference node.

Figure 1a. 3 bus power system

Connected Graph: This is a graph where at least one path (disregarding orientation) exists
between any two nodes of the graph. A representative power system is shown in fig 1a and its
equivalent circuit is shown in fig 1b. The oriented graph of the system shown in fig 1a is given
in Fig 1c, with:
e = number of elements = 6
n = number of nodes = 4

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

b = number of branches = n-1 = 3

l = number of links = e-b = 3
Tree = T(1,2,3) and Co-tree = T(4,5,6)

Figure 1b. Equivalent circuit of 3 bus system

Figure 1c. Oriented graph of 3 bus system

The part of the graph, which satisfies the following condition is called as subgraph. The
conditions are
 Subgraph is itself a graph
 Every node of sugraph is also a node of graph
 Every branch of subgraph is a branch of graph

Eg: sG(1,2,3), sG(1,4,6), sG(2), sG(4,5,6), sG(3,4)

Loop: A sub-graph L of a graph G is a loop if

 L is a connected sub-graph of G
 Precisely two and not more/less than two branches are incident on each node in L
In Fig 1c, the set{1,2,4} forms a loop, while the set{1,2,3,4,5} is not a valid, although the
set(1,3,4,5) is a valid loop. The KVL (Kirchhoff‟s Voltage Law) for the loop is stated as
follows: In any lumped network, the algebraic sum of the branch voltages around any of the
loops is zero.

Cutset: It is a set of branches of a connected graph G which satisfies the following conditions:
 The removal of all branches of the cutset causes the remaining graph to have two
separate unconnected sub-graphs.
 The removal of all but one of the branches of the set, leaves the remaining graph
connected.

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

Referring to Fig 1c, the set {3,5,6} constitutes a cutset since removal of them isolates node 3
from rest of the network, thus dividing the graph into two unconnected subgraphs. However,
the set(2,4,6) is not a valid cutset!
The KCL (Kirchhoff‟s Current Law) for the cutset is stated as follows: In any lumped network,
the algebraic sum of all the branch currents traversing through the given cutset branches is zero.

Tree: It is a connected sub-graph containing all the nodes of the graph G, but without any
closed paths (loops). There is one and only one path between every pair of nodes in a tree. The
elements of the tree are called twigs or branches.

In a graph with n nodes, The number of branches: b = n-1. For the graph of Fig 1c, some of the
possible trees could be T(1,2,3), T(1,4,6), T(2,4,5) etc.

Co-Tree: The set of branches of the original graph G, not included in the tree is called the co-
tree. It could be connected or non-connected, closed or open. The branches of the co-tree are
called links. With e as the total number of elements,
The number of links: l = e – b = e – n + 1.

Figure 1d, shows a possible tree T(1,2,3) with solid lines and co-tree for this combinations are
shown in dotted lines.

Figure 1d. Tree and Co-tree of Oriented graph of 3 bus system (T(1,2,3))

Figure 1e. Fundamental cut-sets with tree T(1,2,3)

Figure 1f. Fundamental loops with tree T(1,2,3)

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

Basic loops: When a link is added to a tree it forms a closed path or a loop. Addition of each
subsequent link forms the corresponding loop. A loop containing only one link and remaining
branches is called a basic loop or a fundamental loop. These loops are defined for a particular
tree. Since each link is associated with a basic loop, the number of basic loops is equal to the
number of links.

Basic cut-sets: Cut-sets which contain only one branch and remaining links are called basic
cutsets or fundamental cut-sets. The basic cut-sets are defined for a particular tree. Since each
branch is associated with a basic cut-set, the number of basic cut-sets is equal to the number of
branches.

Figure 1e and 1f shows the possible fundamental cutset and fundamental loop for the tree
T(1,2,3).

INCIDENCE MATRIX:
Element node incidence matrix (𝑨 ̂ ): The incidence of branches to nodes in a connected graph
is given by the element-node incidence matrix, A ̂.
̂
An element aij of A is defined as under:
aij = 1 if the branch-i is incident to and oriented away from the node-j.
= -1 if the branch-i is incident to and oriented towards the node-j.
= 0 if the branch-i is not at all incident on the node-j.
Thus the dimension of A ̂ is exn, where e is the number of elements and n is the number of nodes
in the network. For example, consider again the sample system with its oriented graph as in
fig. 1c. The corresponding element-node incidence matrix, is obtained as below:
Node
0 1 2 3
Element
1 1 -1 0 0
̂= 2 1 0 -1 0
A
3 1 0 0 -1
4 0 1 -1 0
5 0 0 1 -1
6 0 1 0 -1

Bus incidence matrix (A): By selecting any one of the nodes of the connected graph as the
reference node, the corresponding column is deleted from A ̂ to obtain the bus incidence matrix,
A. The dimensions of A are e (n-1) and the rank is n-1. In the above example, selecting node-
0 as reference node, the matrix A is obtained by deleting the column corresponding to node-0,
as below:
Node
1 2 3
Element
1 -1 0 0
2 0 -1 0
A=
3 0 0 -1
4 1 -1 0
5 0 1 -1
6 1 0 -1

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

Node 1 2 3
twigs
At= 1 -1 0 0
2 0 -1 0
3 0 0 -1

Node
1 2 3
Links
Al= 4 1 -1 0
5 0 1 -1
6 1 0 -1

The bus incidence matrix can be divided in to two parts, i) At, matrix corresponding to twigs
and ii) Al, matrix corresponding to links. Since matrix gives the orientation of branches, so it
obey KCL, we can write, ATi=0, Where i is the vector of branch currents.

Tree-Branch path incidence matrix (K): This matrix gives the incidence of twigs to paths in
a tree, where the path is oriented from a bus to the reference bus. The element k ij of K matrix
is defined as,
kij= 1, if the ith twig is in the path from the jth bus to reference bus & is oriented in the same
direction.
= -1, if the ith twig is in the path from the jth bus to reference bus & is oriented in the opposite
direction.
= 0, if the ith twig is not in the path from the jth bus to reference bus.

Figure 2a. Tree of the oriented graph shown in 1c.

K=[At]-1 and KAt=I. Consider figure 2a, the 0th bus is reference node, then matrix K is written
as

Node 1 2 3
twigs
K= 1 -1 0 0
2 0 -1 0
3 0 0 -1

Basic (Fundamental) Cutset matrix (B): This matrix gives the incidence of elements to the
basic cutsets. The basic cutset should have only one twig and remaining all are links. The
direction of cuteset is considered based on the direction of twig present in that cutset. The
element bij of B matrix is defined as,
bij= 1, if the ith element is incident to and oriented in the same direction as the jth cutset.

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

= -1, if the ith element is incident to and oriented in an opposite direction as the jth cutset.
= 0, if the ith element is not incident to the jth cutset.
Consider figure 2b, the matrix B is written as

Figure 2b. Fundamental cut-sets with tree T(1,2,3)

Cutset
CS1 CS2 CS3
Element
1 1 0 0
2 0 0 1
B=
3 0 1 0
4 -1 0 1
5 0 1 -1
6 -1 1 0

Basic (Fundamental) loop matrix (C): This matrix gives the incidence of elements to the basic
loops. The basic loop should have only one link and remaining all are twigs. The direction of
loop is considered based on the direction of link present in that loop. The element cij of C matrix
is defined as,
cij= 1, if the ith element is incident to and oriented in the same direction as the jth loop.
= -1, if the ith element is incident to and oriented in an opposite direction as the jth loop.
= 0, if the ith element is not incident to the jth loop.
Consider figure 2c, the matrix C is written as

Figure 2c. Fundamental loops with tree T(1,2,3)

Cutset
L1 L2
Element
1 1 0
2 -1 1
C=
3 0 -1
4 1 0
5 0 1
6 0 0

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

PRIMITIVE NETWORKS

So far, the matrices of the interconnected network have been defined. These matrices contain
no information on the nature of the elements which form the interconnected network. The
complete behaviour of the network can be obtained from the knowledge of the behaviour of
the individual elements which make the network, along with the incidence matrices. An
element in an electrical network is completely characterized by the relationship between the
current through the element and the voltage across it.

Figure 3a. Primitive network

Figure 3a shows two unconnected coils with inductance L1 and L2 and mutual coupling of M.
The voltage equations of this coils are given as,
𝑑𝑖1 𝑑𝑖2
𝑣1 = 𝐿1 +𝑀
𝑑𝑡 𝑑𝑡
𝑑𝑖2 𝑑𝑖1
𝑣2 = 𝐿2 +𝑀
𝑑𝑡 𝑑𝑡
From the above equations, its observed that equations does not depend on the connectivity of
coils. These two coils can be called as primitive element and together they form primitive
network.

Figure 3b. General Primitive Element

A primitive element is a fundamental element which is not connected to any other element. A
set of such unconnected elements is defined as primitive network. Figure 3b shows the
generalized representation of primitive network. Where vk is the voltage across branch k, ik is
current through branch k, vsk is independent voltage source at k, jsk is the independent current
source and E is passive element with admittance yk or impedance zk.

Figure 3c. Admittance form of primitive element

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

The primitive network is represented in two forms, i) impedance form and ii) admittance form.
Figure 3c shows the primitive network in admittance form and equation in admittance form is
given as,
𝑖𝑘 + 𝑗𝑘 = 𝑦𝑘 𝑣𝑘
The generalized equation is,
𝑖 + 𝑗 = [𝑦]𝑣
Where i is the vector of currents through the branches, v is the voltage across the branches, [y]
is primitive admittance matrix and j is the vector of injected currents.

Figure 3d. Impedance form of primitive element

Figure 3d shows the primitive network in impedance form and equation in impedance form is
given as,
𝑣𝑘 + 𝑒𝑘 = 𝑧𝑘 𝑖𝑘
The generalized equation is,
𝑣 + 𝑒 = [𝑧]𝑖
[𝑦] = [𝑧]−1

Where i is the vector of currents through the branches, v is the voltage across the branches, [z]
is primitive impedance matrix and e is the vector of equivalent voltage sources.

Eg: Consider three passive elements whose data given in table below.

Element Self impedance (pu) Mutual impedance (pu)

1 0.6j -
2 0.5j 0.2j (with 1)
3 0.7j -

The primitive impedance matrix is given by

element 1 2 3
element
z= 1 0.6j 0.2j 0
2 0.2j 0.5j 0
3 0 0 0.7j

0.6𝑗 0.2𝑗 0
𝑧 = [0.2𝑗 0.5𝑗 0 ]
0 0 0.7𝑗
The primitive admittance matrix is obtained by taking inverse of z matrix.

−1.92𝑗 0.79𝑗 0
𝑦 = 𝑧 −1 = [ 0.79𝑗 −2.31𝑗 0 ]
0 0 −1.43𝑗

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

Formation of YBUS
The bus admittance matrix, YBUS plays a very important role in computer aided power system
analysis. It can be formed in practice by either of the methods as under:
1. By inspection rule
2. Singular Transformation.

The performance equations of a given power system can be considered in bus reference frame
as discussed below:
There are b independent equations (b = no. of buses) relating the bus vectors of currents and
voltages through the bus impedance matrix and bus admittance matrix:
𝐸𝐵𝑈𝑆 = 𝑍𝐵𝑈𝑆 𝐼𝐵𝑈𝑆
𝐼𝐵𝑈𝑆 = 𝑌𝐵𝑈𝑆 𝐸𝐵𝑈𝑆
The YBUS and ZBUS are determined by the following methods.

Inspection Method:

Figure 4a. 3 bus system

Consider a 3 bus system as shown in figure 4a. Taking ground as reference, we can write,
𝐼1 = 𝐸1 𝑦10 + 𝑦12 (𝐸1 − 𝐸2 ) + 𝑦13 (𝐸1 − 𝐸3 )
𝐼2 = 𝐸2 𝑦20 + 𝑦12 (𝐸2 − 𝐸1 ) + 𝑦23 (𝐸2 − 𝐸3 )
𝐼3 = 𝐸3 𝑦30 + 𝑦13 (𝐸3 − 𝐸1 ) + 𝑦23 (𝐸3 − 𝐸2 )
In the above equation, I1, I2 and I3 are net currents injected at respective buses, E1, E2 and E3
are the voltages of respective buses with respect to ground. Y12, y23 and y13 are the admittance
of element connected bus 1-2, 2-3 and 1-3 respectively. The y10, y20 and y30 are the
admittance connected between respective buses and ground. He above equation can be written
as,
𝐼1 = 𝐸1 (𝑦10 + 𝑦12 + 𝑦13 ) − 𝐸2 𝑦12 − 𝐸3 𝑦13
𝐼2 = −𝐸1 𝑦12 + 𝐸2 (𝑦20 + 𝑦12 + 𝑦23 ) − 𝐸3 𝑦23
𝐼3 = −𝐸1 𝑦13 − 𝐸2 𝑦23 + 𝐸3 (𝑦30 + 𝑦13 + 𝑦23 )

In matrix form we can write it as,

𝐼1 𝑦10 + 𝑦12 + 𝑦13 −𝑦12 −𝑦13 𝐸1
[𝐼2 ] = [ −𝑦12 𝑦12 + 𝑦20 + 𝑦23 −𝑦23 ] [𝐸2 ]
𝐼3 −𝑦13 −𝑦23 𝑦13 + 𝑦23 + 𝑦30 𝐸3

𝐼𝐵𝑈𝑆 = 𝑌𝐵𝑈𝑆 𝐸𝐵𝑈𝑆

𝑌11 𝑌12 𝑌13 𝑦10 + 𝑦12 + 𝑦13 −𝑦12 −𝑦13

𝑌𝐵𝑈𝑆 = [𝑌21 𝑌22 𝑌23 ] = [ −𝑦12 𝑦12 + 𝑦20 + 𝑦23 −𝑦23 ]
𝑌31 𝑌32 𝑌33 −𝑦13 −𝑦23 𝑦13 + 𝑦23 + 𝑦30

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

From the above equation, its observed that,

1) The diagonal element Yii of the bus admittance matrix is the sum of admittances of all
elements incident on bus I, including the element between bus i and ground.
2) The off diagonal element Yij is negative of the admittance of the element connected
between buses i and j.
Thus using this rule the admittance matrix is formed by looking at the network. This rule cannot
applicable when there is a mutual coupling. To get the admittance of different components, it
need to be modelled as discussed below.

Modelling of Transmission line:

Figure 4b. Transmission line pi model

Transmission lines are modelled by the nominal pi method. Figure 4b shows the transmission
line in pi model. Where ZL=RL+jXL is the series impedance of the line and yc/2 is half line
charging admittance.
1 1
𝑦𝑖𝑗 = =
𝑍𝐿 𝑅𝐿 + 𝑗𝑋𝐿
𝑦𝑐
𝑌𝑖𝑖 = 𝑦𝑖𝑗 +
2
𝑦𝑐
𝑌𝑗𝑗 = 𝑦𝑖𝑗 +
2
𝑌𝑖𝑗 = −𝑦𝑖𝑗
𝑌𝑗𝑖 = −𝑦𝑖𝑗

Modelling of Transformer:

Figure 4c. Transformer with off-nominal ratio

Figure 4d. pi model of Transformer

Consider the transformer with off nominal ratio a:1 is connected between bus i and j. The
transformer has admittance of yt which is shown in figure 4c. The transformer also modelled

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

as pi model which is shown in figure 4d. The equivalent admittances in pi model are calculated
using following equations.
𝑦𝑡 𝑦𝑡 (1 − 𝑎) 𝑦𝑡 (𝑎 − 1)
𝑦1 = , 𝑦2 = 2
, 𝑦3 =
𝑎 𝑎 𝑎

Using these values, the YBUS are obtained as,

𝑌𝑖𝑖 = 𝑦1 + 𝑦2
𝑌𝑗𝑗 = 𝑦1 + 𝑦3
𝑌𝑖𝑗 = −𝑦1
𝑌𝑗𝑖 = −𝑦1

Modelling of Shunt elements:

Shunt elements like capacitors, reactors and resistor are connected between a bus and ground.
Let the admittance of the shunt element at bus i be ysh, then,
𝑌𝑖𝑖 = 𝑦𝑠ℎ
Eg:
Consider the three bus system shown in figure 4e. The data is given in the table below.

Figure 4e. 3 bus system

Line Bus (p to q) Line impedance Half line charging Off-nominal
admittance ratio
1 1-2 0.133j - 0.909
2 1-3 0.01+0.5j 0.01j -
3 2-3 0.01+0.5j - -
4 3-0 -200j - -

In the system given, there are 4 elements, in that 1 transformer, 2 transmission line and one
shunt element. To find YBUS, we need to find admittance corresponding to the each element.

Consider line 1, A transformer is connected between bus 1 &2, where a=0.909 and zt=0.133j
Considering pi model of transformer as shown in figure 4f, yt=1/zt=-j7.518

𝑦𝑡 −𝑗7.518
𝑦1 = 𝑦12 = = = −𝑗8.271
𝑎 0.909
𝑦𝑡 (1 − 𝑎) −𝑗7.518(1 − 0.909)
𝑦2 = 𝑦10,2 = = = −𝑗0.828
𝑎2 0.9092
𝑦𝑡 (𝑎 − 1) −𝑗7.518(0.909 − 1)
𝑦3 = 𝑦20,1 = = = 𝑗0.753
𝑎 0.909
Consider line 2, a transmission line between bus 1 and 3 with impedance of 0.01+0.5j and half
line charging admittance of 0.01j, parameters this line is obtained as,
1 1
𝑦13 = = = 0.039 − 𝑗1.999
𝑧13 0.01 + 𝑗0.5
𝑦10,3 = 0.01𝑗
𝑦30,1 = 0.01𝑗
Where y10,3 and y30,1 corresponding to half line charging admittance.

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

Consider line 3, a transmission line between bus 1 and 3 with impedance of 0.01+0.5j and there
is no half line charging admittance, parameters this line is obtained as,

1 1
𝑦23 = = = 0.039 − 𝑗1.999
𝑧23 0.01 + 𝑗0.5
Consider line 4, a shunt element is connected between bus 3 and ground with impedance –j200,
parameters of this line is obtained as,
1 1
𝑦30 = = = 0.005𝑗
𝑧30 −𝑗200
Now YBUS is obtained using following formula,

𝑌11 𝑌12 𝑌13 𝑦10 + 𝑦12 + 𝑦13 −𝑦12 −𝑦13

𝑌𝐵𝑈𝑆 𝑌
= [ 21 𝑌22 𝑌23 ] = [ −𝑦12 𝑦12 + 𝑦20 + 𝑦23 −𝑦23 ]
𝑌31 𝑌32 𝑌33 −𝑦13 −𝑦23 𝑦13 + 𝑦23 + 𝑦30

Diagonal elements,
𝑌11 = 𝑦10,2 + 𝑦12 + 𝑦10,3 + 𝑦13
𝑌11 = −𝑗0.828 − 𝑗8.271 + 𝑗0.01 + 0.039 − 𝑗1.999
𝑌11 = 0.039 − 𝑗11.127

𝑌22 = 𝑦20,1 + 𝑦12 + 𝑦23

𝑌22 = 𝑗0.753 − 𝑗8.271 + 0.039 − 𝑗1.999
𝑌22 = 0.039 − 𝑗11.023

𝑌33 = 𝑦30,1 + 𝑦13 + 𝑦30 + 𝑦23

𝑌33 = 𝑗0.01 + 𝑗0.005 + 0.039 − 𝑗1.999 + 0.039 − 𝑗1.999
𝑌33 = 0.078 − 𝑗3.983

Off diagonal elements,

𝑌12 = 𝑌21 = −𝑦12 = 𝑗8.271
𝑌13 = 𝑌31 = −𝑦13 = −0.039 + 𝑗1.999
𝑌23 = 𝑌32 = −𝑦23 = −0.039 + 𝑗1.999

0.039 − 𝑗11.127 𝑗8.271 −0.039 + 𝑗1.999

𝑌𝐵𝑈𝑆 =[ 𝑗8.271 0.039 − 𝑗11.023 −0.039 + 𝑗1.999]
−0.039 + 𝑗1.999 −0.039 + 𝑗1.999 0.078 − 𝑗3.983

Singular Transformation Method:

The performance equation relating to bus voltages and current is given by,
𝐸𝐵𝑈𝑆 = 𝑍𝐵𝑈𝑆 𝐼𝐵𝑈𝑆 (1)
𝐼𝐵𝑈𝑆 = 𝑌𝐵𝑈𝑆 𝐸𝐵𝑈𝑆 (2)
Where EBUS is the vector of bus voltages measured with respect to ground, IBUS is the vector of
current injected into the bus, ZBUS is bus impedance matrix and YBUS is the bus admittance
matrix.
From figure 4f, the performance equation in admittance form can be written as
𝑖 + 𝑗 = [𝑦]𝑣 (3)

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

Figure 4f. Admittance form of primitive element

Multiplying both the sides of equation (3) by AT,

𝐴𝑇 𝑖 + 𝐴𝑇 𝑗 = 𝐴𝑇 [𝑦]𝑣 (4)

We know that, the bus incidence obeys KCL, so we write,

𝐴𝑇 𝑖 = 0 (5)
T
Similarly, A j is the algebraic sum of current injected at each bus, hence
𝐴𝑇 𝑗 = 𝐼𝐵𝑈𝑆 (6)
Substituting equation (5) & (6) in (4),

𝐼𝐵𝑈𝑆 = 𝐴𝑇 [𝑦]𝑣 (7)

Also we know that,
𝑣 = 𝐴𝐸𝐵𝑈𝑆 (8)
Substituting equation (8) in (7),

𝐼𝐵𝑈𝑆 = 𝐴𝑇 [𝑦]𝐴𝐸𝐵𝑈𝑆 (9)

Comparing equation (2) and (9),

𝑌𝐵𝑈𝑆 = 𝐴𝑇 [𝑦]𝐴 (10)

Hence equation (10) gives the singular transformation of the primitive admittance matrix.

Eg: Consider three bus system shown in figure 4g & whose data given in table below.

Element Self impedance (pu) Mutual impedance (pu)

1 0.6j -
2 0.5j 0.2j (with 1)
3 0.7j -

Figure 4g. 3 bus system

The primitive impedance matrix is given by

element 1 2 3
element
z= 1 0.6j 0.2j 0
2 0.2j 0.5j 0
3 0 0 0.7j

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya

Computer Techniques in Power System (21EEE601) Module: 1 Network Topology

0.6𝑗 0.2𝑗 0
𝑧 = [0.2𝑗 0.5𝑗 0 ]
0 0 0.7𝑗
The primitive admittance matrix is obtained by taking inverse of z matrix.

−1.92𝑗 0.79𝑗 0
−1 0.79𝑗 −2.31𝑗 0 ]
𝑦=𝑧 =[
0 0 −1.43𝑗
To bus admittance matrix by singular transformation, we need to obtain bus incidence matrix
A. Figure 4h shows the oriented graph of the 3 bus system shown in figure 4g.

Figure 4g. Oriented graph of 3 bus system

From figure 4g, we can write,

Node
1 2 3
Element
̂=
A 1 1 -1 0
2 0 1 -1
3 -1 0 1
Taking bus 3 as reference node, we can write,
Bus
1 2
Element
𝐴= 1 1 -1
2 0 1
3 -1 0
The Bus incidence matrix A is given by,

1 −1
1 0 −1
𝐴=[ 0 1] & 𝐴𝑇 = [ ]
−1 1 0
−1 0
The bus admittance matrix is determined by,
𝑌𝐵𝑈𝑆 = 𝐴𝑇 [𝑦]𝐴

−1.92𝑗 0.79𝑗 0 1 −1
1 0 −1 0.79𝑗 −2.31𝑗 0 ][ 0
𝑌𝐵𝑈𝑆
=[ ][ 1]
−1 1 0
0 0 −1.43𝑗 −1 0
−1.92𝑗 0.79𝑗 1.43𝑗 1 −1
𝑌𝐵𝑈𝑆 = [ ][ 0 1]
2.71𝑗 −3.1𝑗 0
−1 0
−3.35𝑗 2.71𝑗
𝑌𝐵𝑈𝑆 = [ ]
2.71𝑗 −5.81𝑗
YBUS is often used in solving load flow problem because of its simplicity in data preparation
and ease in modification. Also this matrix is a sparse matrix (where some elements in the matrix
is zero), so it reduces memory required for computation.

EEE Dept, SJEC Mangaluru Prepared by: Dr Sanath Saralaya