N etwork topology

In order to describe the geometrical structure of a network it is sufficient to replace the

network components by single line segments irrespective of the characteristics of the
components. These line segments are called elements and their terminals are called nodes. A
node and an element are incident if the node is a terminal of the element. Nodes can be
incident to one or more elements. A graph shows the geometrical interconnection of the
elements of a network. A sub graph is any subset of elements of the graph. A path is a sub
graph of connected elements with no more than two elements connected to any one node. A
graph is connected if and only if there is a path between every pair of nodes. If each element of
the connected graph is assigned a direction it is then oriented. A representation of a power
system and the corresponding oriented graph are shown in Fig. 1.1.

Fig. 1.1 Power System representations.

(a) Single line diagram
(b) Positive sequence network diagram
(c) Oriented connected graph

Fig. 1.2 Tree and cotree of the

oriented connected graph

1
A connected subgraph containing all nodes of a graph but no closed path is called a tree. The
elements of a tree are called branches and form a subset of the elements of the connected
graph. The number of branches b required to form a tree is

b=n–1 (1)

where n is the number of nodes in the graph.

Those elements of the connected graph that are not included in the tree are called links and
form a subgraph, not necessarily connected, called the cotree. The cotree is the complement of
the tree. The number of links l of a connected graph with e elements is

l=e–b

From equation (1) it follows that

l=e–n+1 (2)

A tree and the corresponding cotree of the graph given in Fig. 1.1 (c) are shown in Fig. 1.2. If a
link is added to the tree, the resulting graph contains one closed path, called a loop. The
addition of each subsequent link forms one or more additional loops. Loops which contain only
one link are independent and are called bam loops. Consequently, the number of basic loops is
equal loops is equal to the number of links given by equation (2), Orientation of a basic loop is
chosen to be the same as that of its link. The basic loops of the graph given in Fig. 1.2 are
shown in Fig. 1.3.
A cut-set is a set of elements that, if removed, divides a connected graph into two
connected subgraphs. A unique independent group of cut-sets may be chosen if each cut-set
contains only one branch. Independent cut-sets are called basic cuts. The number of basic cut-
sets is equal to the number of branches. Orientation of a basic cut-set is chosen to be the same
as that of its branch. The basic cut-sets of the graph given in Fig. 1.2 are shown in Fig. 1.4.

Fig. 1.3 Basic loops of the oriented connected graph Fig. 1.4 Basic cut-set of the oriented connected graph

2
I ncidence matrices

̂
Element-node incidence matrix 𝑨
The incidence of elements to nodes in a connected graph is shown by the element-node
incidence matrix. The elements of the matrix are as follows:

aij = 1 if the ith element is incident to and oriented away from the jth node
aij = -1 if the ith element is incident to and oriented toward the jth node
aij = 0 if the ith element is not incident to the jth node

The dimension of the matrix is e X n, where e is the number of elements and n is the number of
nodes in the graph. The element-node incidence matrix for the graph shown in Fig. 1.2 is

Since

∑ 𝒂𝒊𝒋 = 𝟎 𝒊 = 𝟏, 𝟐, … … , 𝒆
𝒋=𝟎

̂ are linearly dependent. Hence, the rank of 𝑨

the columns of 𝑨 ̂ < n.

3
Bus incidence matrix A
Any node of a connected graph can be selected as the reference node. Then, the variables of
the other nodes, referred to as buses, can be measured with respect to the assigned reference.
The matrix obtained from 𝑨 ̂ by deleting the column corresponding to the reference node is the
element -bus incidence matrix A, which will be called the bus incidence matrix. The dimension
of this matrix is e X (n - 1) and the rank is n - 1 = b, where b is the number of branches in the
graph. Selecting node 0 as reference for the graph shown in Fig. 1.2,

This matrix is rectangular and therefore singular.

If the rows of A are arranged according to a particular tree, the matrix can be
partitioned into submatrices Ab of dimension b x (n - 1) and Al of dimension l X (n - 1), where the
rows of Ab correspond to branches and the rows of Al to links. The partitioned matrix for the
graph shown in Fig. 1.2 is

Ab is a nonsingular square matrix with rank (n - 1).

4
Branch-path incidence matrix K

The incidence of branches to paths in a tree is shown by the branch-path incidence matrix,
where a path is oriented from a bus to the reference node. The elements of this matrix are:

kij = 1 if the ith branch is in the path from the jth bus
to reference and is oriented in the same
direction

kij = -1 if the ith branch is in the path from the jth bus
to reference but is oriented in the opposite
direction

kij = 0 if the ith branch is not in the path from the jth
bus to reference

With node 0 as reference the branch-path incidence matrix associated with the tree shown in
Fig. 1.2 is in the figure above. This is a nonsingular square matrix with rank (n – 1).

The branch-path incidence matrix and the sub matrix Ab relate the branches to paths and
branches to buses, respectively. Since there is a one-to-one correspondence between paths and
buses.

A bK t = U (3)
Therefore,
Kt = Ab-1 (4)

Basic cut-set incidence matrix B

The incidence of elements to basic cut-sets of a connected graph is shown by the basic cut-set
incidence matrix B. The elements of this matrix are:

bij = 1 if the ith element is incident to and oriented in the same direction as the jth basic cut-set

bij = -1 if the ith element is incident to and oriented in the opposite direction as the jth basic
cut-set

bij = 0 if the ith element is not incident to the jth basic cut-set

The basic cut-set incidence matrix of dimension e X b, for the graph shown in Fig. 1.4 is

5
The matrix B can be partitioned into submatrices Ub and Bl where the rows of Ub correspond to
branches and the rows of Bl to links. The partitioned matrix is

The identity matrix Ub shows the one-to-one correspondence of the branches and basic cut-
sets. The submatrix Bl can be obtained from the bus incidence matrix A. The incidence of links
to buses is shown by the submatrix Al and the incidence of branches to buses is shown by the
submatrix Ab. Since there is a one-to-one correspondence of the branches and basic cut-sets,
BlAb shows the incidence of links to buses, that is,

BlAb = Al
Therefore, Bl = AlAb-1
In addition, as shown in equation (1,4),
Ab-1 = Kt
Therefore, Bl = AlKt (5)

6
Basic loop incidence matrix C

The incidence of elements to basic loops of a connected graph is shown by the basic loop
incidence matrix C. The elements of this matrix are:

cij = 1 if tbe ith element is incident to and oriented in the same direction as the jth basic loop
cij= -1 if the ith element is incident to and oriented in the opposite direction as the jth basic
loop
cij = 0 if the ith element is not incident to the jth basic loop

The basic loop incidence matrix, of dimension e X l, for the graph shown in Fig. 1.3 is

The identity matrix Ul shows the one-to-one correspondence of links to basic loops.

Formation of Bus Admittance Matrix Ybus

The Ybus /Zbus matrix constitutes the models of the passive portions of the power network.
Ybus matrix is often used in solving load flow problems. It has gained widespread applications
owing to its simplicity of data preparation and the ease with which the bus admittance matrix
can be formed and modified for network changes. Of course, sparsity is one of its greatest
advantages as it heavily reduces computer memory and time requirements. In short circuit
analysis, the generator and transformer impedances must also be taken into account. In
contingency analysis, the shunt elements are neglected, while forming the Z-bus matrix, which
is used to compute the outage distribution factors.

This can be easily obtained by inverting the Y-bus matrix formed by inspection method or by
analytical method. The impedance matrix is a full matrix and is most useful for short circuit
studies. Initially, the Y-bus matrix is formed by inspection method by considering line data only.

7
After forming the Y-bus matrix, the modified Y-bus matrix is formed by adding the generator
and transformer admittances to the respective diagonal elements and is inverted to form the
Zbus matrix. The performance equation for a n-bus system in terms of admittance matrix can
be written as,

 I1  Y11 Y12 ... Y1n  V1 

 I  Y Y ... Y2 n  V2 
 2   21 22
. . . ... .   . 
    
.  . . ... .   . 
 I n  Yn1 Yn 2 ... Ynn  Vn 
(or)

I = Ybus.V

The admittances Y11, Y22,… Ynn are called the self-admittances or driving point admittances at
the nodes and all other admittances are called the mutual admittances or transfer acmittances
of the nodes.

Formulae Used:
n
Main diagonal element in Y-bus matrix = Y
j 1
ij  Bij

where, Bij is the half line shunt admittance in mho.

Yij is the series admittance in mho.

Off-diagonal element in Y-bus matrix , Yij = -Yij

where, Yij is the series admittance in mho.

Sample Problem:
The bus and branch data for a 3-bus system is given in table below. Form Y bus matrix by
inspection method.

Bus Code Impedance Bus Number Admittance

1–2 0.06 + j0.18 1 j0.05
1–3 0.02 + j0.06 2 j0.06
2–3 0.04 + j0.12 3 j0.05

8
Solution:
Formation of Y bus:
 1 1  1 1 
   j 0.05  
 0.06  j 0.18 0.02  j 0.06  0.06  j 0.18 0.02  j 0.06 
 1  1 1  1 
Ybus      j 0.06  
 0.06  j 0.18  0.06  j 0.18 0.04  j 0.12  0.04  j 0.12 
 1 1  1 1 
   j 0.05  . 
 0.02  j 0.06 0.04  j 0.12  0.04  j 0.12 0.02  j 0.06 

6.66  j19.95  1.66  j5  5  j15 


Ybus    1.66  j5 4.16  j12.44  2.5  j 7.5 
  5  j15  2.5  j 7.5 7.5  j 22.45

FORMATION OF Y-BUS WHEN REGULATING TRANSFORMER IS PRESENT.

A regulating transformer is used in transmission line to control real and reactive power by
varying the phase angle and magnitude. Equivalent representation of the line with regulating
transformer is as shown

9
 In the above fig ‘a’ is the transformer ratio which can vary from 0 and 1 & ’a’ is known as “off
nominal ratio”

NOTE: The value of ‘a’ is very small, because the regulating transformer are used to provide
only a small boost to transmission voltage. Since ‘a’ is small can be considered as real. The
voltage ratio of regulating transformer is called as “off-nominal ratio”, because this voltage
ratio is not used for determining the ratio of base KVA of the lines which are connected two
sides of regulating transformer.

DERIVATION:-

 Method-1:
When transformation ratio or off nominal ratio is 1:a

I1’= (V1’-V2) y12 ……… (1)

𝑽𝟏 𝟏 𝑰′𝟏
Where = = …. (2) (Transformation ratio)
𝑽′𝟏 𝒂 𝑰𝟏

V1`= a*V1 ……….. (3)

𝑰𝟏
I1` = ……… (4)
𝒂

𝑰𝟏
= (a*V1-V2) y12
𝒂

I1 = (𝒂𝟐 y12V1-aV2y12) ……….. (5)

I2 = (V2-V1`) y12 = (V2-aV1) y12

I2=V2*y12 - aV1y12 ……. (6)

10
 From equation (5) & (6) we get
 I1   a 2 y12  ay12  V1 
I      ……….(7)
 2   ay12 y12  V2 

∏-Model representation

From the above diagram we see that,

Y11 = ay12+x
And from eqn. (7), we see that
Y11 = 𝒂𝟐 y12
𝒂𝟐 y12=ay12+x
Therefore,
x = (𝒂𝟐 − 𝒂) y12 = (a - 1)a y12

Y22=x’+ay12
Since y22=y12 (from eqn. (7))
Therefore,
x’= (y12-ay12) = (1-a) y12

From this equivalent ∏-model we observe that if a=1 then x and becomes equal to zero and
equivalent line representation will be the same as without regulating transformer.

11
 Method-2:
When transformation ratio or off nominal ratio is a:1

I1ˈ= (V1ˈ-V2) y12 …… (1)

𝑽𝟏 𝒂 𝑰′𝟏
Where = = ..…. (2)
𝑽′𝟏 𝟏 𝑰𝟏
𝑽𝟏
V1ˈ= …… (3)
𝒂

I1ˈ= a*I1 ….. (4)

𝑽𝟏
aI1 = ( -V2) y12
𝒂

𝑽𝟏 𝑽𝟐
I1 = ( − ) y12 …. .(5)
𝒂𝟐 𝒂

I2 = (V2-V1ˈ) y12

𝑽𝟏
I2 = (V2 - ) y12
𝒂

𝑽𝟏
I2 = - y12+V2y12 …… (6)
𝒂

From equation (5) & (6) we get

 y12 y12 
 I1   a 2 
a  V1 
I    y   ……..(7)
 2   12 y12  V2 
 a 

12
 ∏-Model representation

From the above diagram we see that,

𝒚𝟏𝟐 𝒚𝟏𝟐
Y11 = +x , where Y11 = ( from eqn. 7)
𝒂 𝒂𝟐
𝒚𝟏𝟐 𝒚𝟏𝟐
= +x
𝒂𝟐 𝒂
𝒚𝟏𝟐 𝟏−𝒂
Therefore, x = ( )
𝒂 𝒂
Now,
𝒚𝟏𝟐
Y22=xˈ+
𝒂
𝒚𝟏𝟐
Since, y12 = xˈ+
𝒂
𝒚𝟏𝟐
Therefore, xˈ= (𝒂 − 𝟏)
𝒂

P rimitive network

Network components represented both in impedance form and in admittance form are shown
in Fig. 1.7. The performance of the components can be expressed using either form. The
variables and parameters are:

vpq is the voltage across the element p-q

epq is the source voltage in series with element p-q
ipq is the current through element p-q
jpq is the source current in parallel with element p-q
zpq is the self-impedance of element p-q
ypq is the self-admittance of element p-q

Each element has two variables, vpq and ipq. In steady state these variables and the parameters
of the elements zpq and ypq are real numbers for direct current circuits and complex numbers
for alternating current circuits.
The performance equation of an element in impedance form is

13
vpq + epq = zpqipq (6)
or in admittance form is

ipq + jpq = ypqvpq (7)

The parallel source current in admittance form is related to the series source voltage in
impedance form by

jpq = -ypqepq

Fig 1.7 Representation of a network component. (a) Impedance form (b) admittance form
A set of unconnected elements is defined as a primitive network. The performance
equations of a primitive network can be derived from (6) or (7) by expressing the variables as
vectors and the parameters as matrices. The performance equation in impedance forms is

v + e = [z]i
or in admittance form is
i+ j = [y]v

A diagonal element of the matrix [z] or [y] of the primitive network is the self-impedance zpq,pq
self-admittance ypq,pq. An off-diagonal element is the mutual impedance zpq,pq or the mutual
admittance ypq,pq between the elements p-q and r-s. The primitive admittance matrix [y] can be
obtained by inverting the primitive impedance matrix [z]. The matrices [z] and [y] are diagonal
matrices if there is no mutual coupling between elements. In this case the self-impedances are
equal to the reciprocals of the corresponding self-admittances.

14
F ormation of network matrices by singular transformations

Network performance equations

A network is made up of an interconnected set of elements. In the bus frame of reference, the
performance of an interconnected network is described by n – 1 independent nodal equations,
where n is the number of nodes. In matrix notation, the performance equation in impedance
form is

EBUS = ZBUS IBUS

or in admittance form is
IBUS = YBUSEBUS
where,
EBUS = vector of bus voltages measured with respect to the reference bus
IBUS= vector of impressed bus currents
ZBUS =bus impedance matrix whose elements are open circuit driving point and transfer
impedances
YBUS= bus admittance matrix whose elements are short circuit driving point and transfer
admittances

In the branch frame of reference the performance of the interconnected network is

described by b independent branch equations where b is the number of branches. In matrix
notation, the performance equation in impedance form is,

EBR = ZBRIBR
or in admittance form is
IBR = YBREBR
where,
EBR = Vector of voltages across the branches
IBR = vector of currents through the branches
ZBR = branch impedance matrix whose elements are open circuit driving point and
transfer impedances of the branches of the network
YBR = branch admittance matrix whose elements are short circuit driving point and
transfer admittances of the branches of the network

In the loop frame of reference, the performance of an interconnected network is

described by l independent loop equations where l is the number of links or basic loops. The
performance equation in impedance form is

ELOOP = ZLOOPILOOP

15
or in admittance form is

lLOOP = YLOOPELOOP

where,
ELOOP = vector of basic loop voltages
ILOOP = vector of basic loop currents
ZLOOP = loop impedance matrix
YLOOP= loop admittance matrix

Bus admittance and bus impedance matrices

The bus admittance matrix YBUS can be obtained by using the bus incidence matrix A to relate
the variables and parameters of the primitive network to bus quantities of the interconnected
network. The performance equation of the primitive network

i + j = [y]v
is premuItiplied by At, the transpose of the bus incidence matrix, to obtain
Ati + Atj = At[y]v (1.1)

Since the matrix A shows the incidence of elements to buses, Ati is a vector in which each
element is the algebraic sum of the currents through the network elements terminating at a
bus. In accordance with Kirchhoff's current law, the algebraic sum of the currents at a bus is
zero.
Then,
Ati = 0 (1.2)

Similarly, Atj gives the algebraic sum of the source currents at each bus and equals the vector of
impressed bus currents. Therefore,

IBUS = Atj (1.3)

Substituting from equations (1.2) and (1.3) into (1.1) yields

IBUS = At[y]v (1.4)
Power into the network is (I*BUS)t EBUS and the sum of the powers in the primitive network is
(j*)tv. The power in the primitive and interconnected networks must be equal, that is, the
transformation of variables must be power-invariant. Hence,

(I*BUS)t EBUS= (j*)tv (1.5)

Taking the conjugate transpose of equation (1.3)

16
(I*BUS)t = (j*)tA*

Since A is a real matrix

A* = A
and
(I*BUS)t = (j*)tA (1.6)
Substituting from equation (1.6) into (1.5)
(J*)tAEBUS = (j*)tv
Since this equation is valid for all values of j, it follows that
AEBUS = v (1.7)
Substituting from equation (1.7) into (1.4),
IBUS = At[y] AEBUS (1.8)
Since the performance equation of the network is

IBUS = YBUSEBUS (1.9)

it follows from equations (1.8) and (1.9) that

YBUS = At[y] A
The bus incidence matrix A is singular and therefore At[y] A is a singular transformation of [y].
The bus impedance matrix can be obtained from
ZBUS = Y-1BUS = (At[y] A)-1

Examples on Primitive Networks:

Example-1:Given that the self impedances of the elements of a network referred by the
bus incidence matrix given below are equal to: Z1=Z2=0.2, Z3=0.25, Z4=Z5=0.1 and
Z6=0.4 units, draw the corresponding oriented graph, and find the primitive network
matrices. Neglect mutual values between the elements.

17
Solution:
The element node incidence matrix, Aˆ can be obtained from the given A matrix, by
preaugmenting to it an extra column corresponding to the reference node, as under.

Based on the conventional definitions of the elements of Aˆ , the oriented graph can be
formed as under:

Fig. E4 Oriented Graph

Thus the primitive network matrices are square, symmetric and diagonal matrices of
order e=no. of elements = 6. They are obtained as follows.

18
Example-2: Consider three passive elements whose data is given in Table E5 below. Form
the primitive network impedance matrix.
Table E5

Solution:

Note:
· The size of [z] is e´ e, where e= number of elements,

19
· The diagonal elements are the self impedances of the elements
· The off-diagonal elements are mutual impedances between the corresponding
elements. · Matrices [z] and [y] are inter-invertible.

20