Power System Network

Motrites
i/

1.T INTRODUCTION

Graphs are very useful in the slveral fields like engineering, physical and social, etc. Many
applications of several electrical components such as machines and power system component
characteristics are representing in a simple way in graph form and for analysis of electrical circuits
also it plays very important role. For small circuit analysis based on nodal and meshed equation
methods by using KirchhofT's law and Ohm's law are sufficient. But for complex networks these
methods are difficult and take more time for solving the equations. In this chapter brief discussions on
graph theory and the applications of graph theory in power system networks are going to be presented

in detail.

t.2

DEFINITIOI{S

Graph Theory
When the e-l-e$g-4lllike resistqrs, inductors,-capacitors and voltage sources [shown in Fig. 1.1(a)] in
a nerwork are ieffied by lines. This type of network is called the 'graph' is shown in Fig. 1.1(D) and
the line segments are joined by means of nodes. The rank of the graph is 'n- 1 ' , where r is number of
nodes of the graph. The graph thus obta\ned is also known as undirected graph. While drawing graph
series elements can be replaced by a single edge in the graph.

Q
Fig. f.f(a)

Netwwh

Fig. f .f (b)

Equivnlcnt

grqh

Elffiical Pouer

Silstem Analgsls

(hiented Giaph

srapn whose branches are oriented is called oriented graph and is shown in Fig. 1.2.
It is also called

as directed graph.

Fig. '1.2 Odentetl. Grapb

Node
Tlre meeting point ol'the two or more elements in the graph
is called as .node, and denoted by ,n,
is also called as vertex.

.It

Element (Edge)
An element is a line segment representing one hetwork element
or a combination of
connected
Ex. :

between two nodes. The number of elements is represente

dby ,e,
From Fig. 1.2,

'elements

nodes
n = 2,
Nunrber of elements e : 3.
Number of

Degree: The number of elements connected to a node

is called degree.

Sub-graph
It is a subset of branches and nodes of a graph. The sub-graph
is said to be proper
strictly less than all the branches and nodes oi the graph.

if it

consists

of

Tree

A tree is a connected sub-graph of a connected-graph containing all

the nodes of the graph but
containing no closed paths or loops. If the graptf consistint
'n' number of node, the number of
branches ofa tree is (z - l). It can also be referred in
this con-text as spanning tree sinci it spansover
all the verrices of the graph.
A tree has the following properties :

i\
-' '
I Tree is a sub-graph containing ail the vertices of the originar graph.
)
i 2. Tree is a connecred graph.
1 3. Tree does nor conraining anyloop. ,
\ 4. Every connected graph has at least one tree.
rree has (n - 1) branches and rank is also (z _ 1).
\ l. !*h
,n-. elemenrs in the spanning tree are called branches or hyigs.
\9:
,6, :
the number of
\grefore

tree branches

1n

_ l).

Potuer Sgstem

Nefitork Mafrices 3

Cotree
It is a sub-graph formed with all the links of the graph or, in other words co-tree is a complement of
a tree. The number

:
D:
n:

where e

orunk@

: e - (n - l),.

number of elements

y =

number oftree branches

-rrr b
-<->A

number ofnodes

Twigs
These are the branches of a tree.

Links
The elements that are not on a tree or elements of the co-tree are called links or chords. The number

oflinksisrepresentedbyLNumberoflinks,tmfl
where e : numbei of elements
n : number ofnodes
Gut Set

It is a rninimal set of elements of a connected graph, such that the removal

graph isolated at least one vertex.

of these elements from

Tle.set
A fundamental tie.set of a graph with respect to a tree is a
forrned
one link associated
rith other twigs.- since for eaqh link of the tree their coriesponaing ro i
, the
ntmber of fundamental loops is equal to the number of links in the given tree. Number of fundamental

loqsorlinks, l:e-n+l/
rfiere e : number of elements of graph,
n = number of nodes of

L:I

TYPES OF

l.

a graph.

MATRI.CES
incidence matrix [A']

2- Bus incidence matrix

[A]

3. Branch path incidence matrix [K]

4- Basic cut-set incidence matrix [B]

5. Augmented cut-set matrix IB') ,.

/
6- Basic loop incidence matrix [C]
7_ Augmented loop incidence matrix [C'],

t3.1
E
-i

Element llode lncldence Matrix

ircidence of elements to nodes in a connected graph is given by element node incidence matrix
is derioted Ly A'.

Electrical Power System Analysls

To determine the elements of A' matrix for the Fig. 1.3 as follows

ai : l,If

ift element is incidence and oriented

the

l$X$om

theT'fr node.

: - l, If the ith element is incidence and oriented towards the je node.

aij : 0,If the /h element is not incident to theTm node.
a,j

The size of the matrix is (e x n)

z=

number of node in the graph

@o

era'@ O
l [l

r
:lr

zl
A':

-t---

lo

r lo
610

00
-1

-l

o
o

_0_

o
0

_1

-1 0
I -t
I -t

It is observed from the elements of the matrix that

3

:0, for P = 1, 2, ...,6

Lo,
.l=o
It can be inferred that the column of A' is linearly independent and the rank of A' is-Iess than 'n'.

,..3.2

Bus lncidence Matrlx

Any node ofa connected graph can be selected as the reference node. Then the uariable ofthe other

nodes, referred to as buses, can be measured with respect to the assigned reference(The matrix obtained
from the element-incidence matrix (A) by eliminating the column corresponding tb the reference no@

is the bus incidence matrix 'A'r7The order of the matrix is [e x (r - 1)] and fte rank is (n
Selecting node (0) as reference node in the graph shown in Fig. 1.3.

elbus

@O O

,[-r 0
-l

ol
ol

5l

=(*)
io -?-+l
r -rl

6L

o r

-r.l

2l o
A_

where 4.6

;i

matrix formed by twigs.

l-- r

00-l

Ar:10 -1 0l
Io 0 -rl
I

- 1).

Al

matrix formed by links.

o,:
1.3.3

-1
I

lo
[or

jl

Branch Path lncldence Matrix

The branch path incidence matrix shows the incidence of branches to paths in a tree, where a Path is
tode.
oriented from a bus to the

refere

We can determine the elements of this matrix as follows:

K,

: l, if the re branch is in the path from theTth bus to reference and is oriented in the
same direction.

Ku =

'

K,

1,

if

the ifr branch is in the path from theT'fr bus to reference and is oriented in

the opposite direction.

0, if the ifr branch is not in the path from

the jth bus to reference

reference.
The branch path incidence matrix associated with the tree shown in

with node '0'

as

Fig. 1.4 is

C @ O
l[-1 o ol

branch/path

o -r ol
sL o o -r.l

r=21

The non-singular square matrix with rank (n

1)

I : 3 f4,5,61

b:3 Il,2,3l
Ite branch path incidence matrix and the sub TatrixArrelate
thanches to pattrp and branch6b to bu$es, respectively. Since

is one to one correspondence between paths.and buses.

A6I{ :
KT :

ft

U
Aa-l

Fig. 1.4
.

U-is an ldentities or Unit matrix.

Baslc Cutet lncidence

is a minimal set of branches of the

groups,

removal of which cuts the graph into two parts. It

being in one of the two parts is shown in Fig. 1.5-

6 Electrical Power Sustem Annltrctc

We can determine the elements of this matrix
B,J

".

: 1,

rorrornF

when the ifr branch is in the cut_setf,

and orientation coincide.
- - l, when the i6 branch is in the cut-set,/, and orieirtation do not coincide.
: 0, when the ifr branch is not/the cut_setl.
The basic cut-ser
6
tt-Set inciden.e
rnqtriv nf
rli---^:^-^ ,- .,-. .
incidence matrix
of dimensions
1a x ai for
the graph shown in Fig. I.5 is
Basic cut-sets

elb a b

rf 10ol

'::rtl+;l
s'lo -1 tl

u L o -1

Fig.

1l

1.5

The matrix 'B' can be partitioned into sub

matrix U6 and B1, where the rows of U_6_correspond
to
branches and the-rows ofb, to links.
The partitioned matrix is
Basic cut-set

bc

1[

001

I
0

2lo
3l o

':r[- -r
I

where U,

oL

unit matrix formed by twigs

-1

0l
1l
I

0l

t;:]

1l

rl

(r o o)

Io

B,

matrix formed by links

r ol

[o ot)

IJl:l
( 0 -1
1)

ll
i

il'

The identity matrix u6 shows the one to one correspondence

of the branches and basic cut-sets.
The sub matrix B, can be obtained from the bus
incidence matrix 'A,. The incidence of links
buses is given by the sub matrix Al and the
incidence of elements to buses is given by the
sub ma
'46" since there is a one to one correspondence of
the elements and basic cup-sets, B1 46 givel
incidence of links to buses,

oE.,

Pouer S,stem Netuork Matrices

T

BtAtr:At
Bl = Al Ar-l
Br = Al Kr lsince Ar-1

135

11r,

Augmented Cutet lncidence Matrix

in the basic cur-ser incidence matrix.

ryF:,",:.H[:f [.*:::,:j,T,,:T]::g,::
rhe
,,a. .q,.ii" ir,eri#i.' llayrres
;ittHJ,il'ff
l*:::::ffi';:;',1;f,*:l;
*:j,iJi;:Xll;t:
imaginary

H*:",li::::::..r:::l::*-,u,.o,,sinini'onrv.od.rink:,fi;:,.ffiJ$Htrrr
[::]I:i,H,,*ff:ff9:S],*,,::::,I1" ""_;iil":t,:,,1",ff i::ji[:li::fi,il,1:#i:
-r.6
;1X,,1:':::.:':'i:::_1'_1;"ilr;ffi;**.Hd}l;l:tT-:"1H:i:ffJ'J:i?-,ffJffxi.T;f
rb '8" is a square marix of size (e x e). The B, ,ut.i*
Basic

ele

I
2
3

r-

4
5

6
7

re

cut-set

a bc

le f
r 0 0t0l 00
o r o oi 00
0 o t,oi 00
o o o. rl 00
-------------t

is given berow.-,,

6o

0'
0

ol
ol

Basic cut-set I tie sets

tJb i o
0 -l 1 I 100 =----B;----l--u,-l I 0 0 010
0 -l I 0 001

Fig.

Basic Loop lncidence Matrix

1.6

rnatrix gives the incidence of eremenrs

ro basic loops of a connecred graph.

HHfili:g.""t
!b

,".ir*.

fie sets

elements of this matrix can be

formed as follows

:
the erement 'j', is in basic loop
J, and their directions coincide.
',, : -'. l, when
-,_n., the erement 'i' is in basic
,j,
loop
andtheir directions do not coincide.
: 0, when the element is not in theTth
basic loop.

rize of matrix .C, is (e x

e/l

-1
-1
-T

4
5

Ly. The

-l

C matrix for Fig. 1.7

qi given below

()^(

-t

=f

cb
U,

I
Fig. 1.7

Electrical Pouer Sgstem Analysrs

where

C,

the matrix formed by twigs

(0

0\

",:l-r o
[-,

ll

U,

: unit matrix formed by links

. (t 0 0\

rl I

U7:10

0l

[o o

The matrix 'C'

1)

can partition into sub matrix

branches and the rows of ,U/, to links.

L.9.7

oJ

.cr,

.u,,, where

and

the rows

of ,c6, correspond to

Augmented Loop lncidence Matrix

*:"1|:l:'-:.rj::f^Li::T:",,:d

g.rph is equat to rh number of links. rhe total number of loops

;;;"h*,;;rffiffiffi;*ffi:

*l:f".: j:T::T:*Iro,u:rylllbgfy.eenadj;;t;ile;;;;ffiy;ffi ;':i,ilffi;ffi;

ffi;&;;;;;;;; i;. il.;ffi.'#i;
SilT
An nnpn lnnn then rtpfi-on ^d +L^ -^.L r^i.---^,- , 'thd orienration or an open
s:^"p-h
F,r"l ir.Fig:.I.8,
branch. It is denoted
by C'.

This matrix

C'for

loops
a b c d,,

Open

ele
I
2

C':

4
5

6
7

the graph shown in

Fig. 1.g given below

basic loops

fg

1000
010
0100
1 -l I
0010 -1 0 -1 _lu,
.,
0001 -1 0 0 ----------L
0
0 0 0i 100
i....u;
0000
010
0000
001

l'

D
Fig. 1.8

It is a square matrix of size (e x e) and is non-singular. The use of these

augmented inc
matrix will be seen when non-singular method of obtaining
network matrices are discussed.

7..4

CONSTRUCTTON OF NETWORK MATRICES

Power system network consists of number of components, (generators,

transformeter, transmis
lines, etc.)which are interconnected normally. Either
,r*iru.t
..r
or
design office supplies
details of individual components.
The information giving the characteristics of individual
components are represented by .pri
network'.

['

Primitive network is a set of unconnected elements

rtrPrcl
either impedance form
'v'vu Lrwr'E,]r represented

[admittance

form.

Matices 9

Pouser Srfstem Netusotk

To devglop the net{ork matrices the effect of interconnection between the elements are included
by suitable transformation.

1.5 NETWORK

MATRICES

The mathematical model of the netwqrks can be developed in three different forms and these are

1. Bus frame of reference -rt'

2. Branch frame of reference /
3. Loop frame of reference

1.5.1 &s

of Reference

Frame

The bus current and voltage vector equations of a network can be written

:
r*
(n-l)xl
:
[V] ,,,
[I]

(n-l)xl

[Y]
[Z]

ru,
(r-l)x(n-l)

[V]

,u,

[I]

(,r-l)x(,r-1)

(z-l)xl
",.

"*
(n-1)xl

as

(Admittance
(Impedance

/
form) /

form) ,r/

,/

/r...(l.L)
...(t.Z)

Il
l2

Tbre

[I] ,r,

(n-l)xl

Vector of impressed bus currents matrix =

ln

-t
v,
Y2

[V]

,*

(n-l)xl

Vector of bus voltagesmeasured with respect to reference bus

ur

[Y] ,,,

Bus admittance matrix

,*

Bus impedance matrix

tn-l)x(n-l)

[ZJ

ln-t)x0,-l)

Grnri&r

z/
./

3-bus system as shown in

Fig. !.9, thelZrus and YBus matrices are given below

Fig. 1.9

3-bas poror system networh

-,

.-

1O

,,/

Etectricol Potaer Sgstem Analgsis

Yru.:

(Y,, Y,,

Yrr)

["r, Y,

Y,
vu)

IY, Y,

('" z" '"\

zsu": lZl 22 zr,
l.Z''

z" z")

The impedance or admittance element on principal diagonal elements are called driving point
impedance or admittance of bus and the off diagonal elements are called transfer impedance or
admittance of the bus.

L.5.2

Branch Frame

of

Reference

The equations are written in branch currents and branch voltages

[I] n,
(n-r)xr

[v]

,.

[Y]

= lzl

(,r-r)xr

Fl

".
(,-t)x(,-t)

,.
(n-r)xr

(Impedance form)

lrl ,,

B,

(Admittance form)

...(1.3)
...(1.4)

(,-r)*(,,-r) (n-r)xr

where [t] ,,

Column vector of branch current

,,

Column vector of branch voltage

Branch admittance

{n-l)xl

[V]

lYl
Lz)

1.5.3

(r-l)xl

(n-l)x(rr-l)
',
u,

(n-l)x(n-1)

= Branch

Loop Frame

of

{$"}i.

impedance matrix

Reference

The following equations are written for loop currents and loop voltages

[I]

'*,
c-(n-l)xl

e-(n- l)x e-(n-t\

: lZ) ,,,oo

[v] -",

e-(n-t)xt

where

[I] *",

[Y] r_ooo
(,
"- -

r) x

[V]

e-(r - r)

Vector of loop current,

Vector of loop voltage

Loop admittance matrix

Loop impedance matrix

e-(n-l)xl

[v] -",
e-(n-l)xl
[Y]

lz)

*",

c-(n-l)xe-ln-l)
^"n
e-(n-l)re-(n-l)

*,0

e-

(a

-l)x

(Admittance

form)

...(1.5)

(Impedance

form)

...(1.6)

tI]**
e-(a-1)xl

Potaer System Network

1.6

Mafiires

11

CONSTRUCTION OF PRIMITIYE NETWORK ETEMENT

There are two types of representation for primitive nefworks and they are

1. Impedance form
2. Admittance form

1.6.1

lmpedance Form

Consider the network having two nodes 'a' and'D' is shown in Fig. 1.10, the equations of primitive
network in impedance form can be written as

Fig. I.Io

vn6:
en* eny-Za;ioy:
o- b * enu:

Zo6in6

vab+e(tb:Zabinb

,qs:lz)i
rrhre

vou =
eou:

la6 :

...(1.7)

voltage across element 'a - b'

voltage source in series with element'a

b'

current through the element 'a - b'

Zolr: impedance matrix of element 'a - b' .

L6.2

Admittance Form

Cmsider tire networt shown in Fig. 1.11, the equations of primitive network in admittance form can
be written as

...>

Fig.
iot

* joo: labvab

t+j:[Y]v
rrbre jn, yr6 :

I.ll
...(1.t)

current source between nodes a

admittance matrix of branch a

D.

lF

12

Electrical Power Sgstem Analysis

7..7

NETWORK MATRIX FORT|ATION

The admittance matrix Y and impedance matrix

1.

Z canbe determined by using the following methods.

Based on the incidence matrices

(a)

2.

1.8

Singular transformation method

(D) Non-singular transformation method
Based on the network analysis equations
By direct inspection method.

SINGULAR TRANSFORMATION METHOD

By using singular transformation, we can derive bus, branch and loop impedance matrix as well
admittance matrix for the primitive netwok.

1.8.1

as

Determination of Bus lmpedance and Bus Admlttance Matrlces

The bus impedance matrix Zsu, and bus admittance matrix Yso. coo be determined by using the bus
incidence matrix 'A' to related variable parameters of the primitive network quantities of the interconnected network.

From the primitive network equation (1.8)

i+i:$lv

...(1.e)

Ar
e'[Y] v

Pre-multiplying the both sides with

Ari + At,/:
'*- According to Kirchhoff's current law the algebraic

" '(1'10)
sum of currents meets at any node is equal to

zeto.

i.e., sum of currents meeting at a node

Similarly

A'./ :

Ar i

: 0

sum of current sources of element incidence at a node .

...(1.11)
It is a column vector

AT,/ : Is*
Substituting the equations (1.11) and (1.12) in equation (1.10), we get

: At [Y]
t'
Power into the network : [I*sur] V"u,

...(1.13)

IBu,

Therefore, [.

srr]T VBu,

.. .(1.12)

the surn of powers in the primitive network, i.e.,1i"1r v

U-]t

, ]

Taking conjugate transpose of equation (L.12), it is modified

...(1.14)
as

: [I*rr.]'
But A is a real matrix so A* : A,
From matrix property [Ar]r : A
[A']*r U*lt

...(1.ls)

Applying these two conditions in equation (1.15), we get

[I.'u']'

: A[i.]: $

...(1.16)

Substituting the eqgation (1.16) in equation (1.14) and simplify

Substituting

;{ vBus : v
the'V'from equation (1.17) in equation (1.13)

...(1.17)

Power System NetuorkMafrfces 13

IBu,

: e' Dl A vso.

.. .(1.18)

Equating the equations (1.1) and (1.18), we get

[Ysur]

At [y] e

.. .(1.1e)

And Zsu, can be determined by

[Zsu,]

[YsuJ-l

" ,...(1.20)

{Ar D] A}-1

1.8.2

Determlnation of Branch lmpedance and Branch Admittance

Matrlces
The branch impedance matrix 'Zrr' and branch admittance matrix 'Ysr' are to be determined by
using the branch incidence matrix 'B' to related variable parameters of the primitive network
quantities of the inter-connected network.

From the primitive network equation (1.8)/rl admittance form is

i+i:[y]V

..

Pre-multiplying the both sides with

.(r.21)

'Br'

Bri+B'"/:BtDlv
According to Kirchhoff's current law (the algebraic sum of currents at any node is equal to zero)

Br I

sum of currents passing through the elements that are connected to basic

cut-set

BTi :Q
BTJ

...(r.23)

sum ofcurrent sources ofelement incidence to the basic cut-set and

represents the total source current in parallel with a branch. It is a

column vector

BTJ :

...(1.24)

IS,

Substituting these two conditions in equation (1.22), then

Isr:BrDlv

..

.(r.2s)

Power into the network is given by (U-srlT Vsr) and this is equal to the sum of powers in the
primitive network, i.r., U"l' v. Since power is invariant.
Power in the primitive network

[I-sJr VB. :

powr in the interconnected network

[l-]''

...(r.26)

Taking conjugate transpose of equation (1.25) it is modified as

[B'].r U*]t = [I*r,]'

But

'B'

is a real matrix so, B*

From matrix property

[Br]r

(...

BrDlv

e})

...(1.27)

B,

Applying these two conditions in equation (1.27), then

[I*nr]r

...(1.2E)

B U*lr

From the equations (1.26) and (1.28)

BVsr:v
Finally substituting 'v : B Vsr' from equation (I.29),

...(1.29)
in eqn. (1.25)

Is,

Br [y] B Vs.

...(1.30)

The branch frame reference of admittance form can be written as

Ig, : [Yr.] Vrt

Comparing the equations (1.30) and (1.31)

lYe.l

...(1.31)

: g'Dl n

After calculating l[Yrr]' next from this expression we can calculate ,lzsrl,
i.e.,
tZs,l : [ysJ-t : {Br D] B}-t

1.8.3

..

.(1.32)

...(1.33)

Determinatioq of Loop lmpedance and Loop Admlttance Matrlees

The loop impedance matrix^'-Zruor' and loop admittance matrix 'Yloop' are to be determined by using
the bus incidence matrix 'C' to relate variable parameters of *re p-iirlitive network quantities of thc

inter-connected network.

From the primitive network equation (1.7) in impedance form is

v+e:lzli
Pre-multiplying the both sides with

'Cr'

Crv+ w
Cre:
e: \cr[z]i
tzl r

...(1.

According to Kirchhoff's voltage law (the algebraic sum of voltage in a closed loop is equa
equal

zero)

:
cr e :
v,-oop :
Cr v

sum of voltages in a closed loop

sum of voltage sources around each basic loop.

[Cr]

It is a column vector

Substituting these two values in equation (1.35) then

Vluop

: cr lzl t

From power invariance condition for the loop and the primitive networks is given by
VLo,,p' and this is equal to the power in the primitive network, i.e.,,i*r e, .
Power in the primitive network = powr in the inter-connected network

ttl*lt vl-p :

[i"lr e

In equation (1.38), substituting Vloop

lClr

'

.
lll,,orl' [Clr e: [i*]r ,
Eliminating 'e' and taking transpose of above equation, it is modified
i : [C*]r [Ir_oop]
But 'C' is a real matrix, C* : C,
i: 1C1a1l*or.;
Fromrthe equations (1.35), (t.37) and (1.41)
vl-p : tCrl tel [C] Ir.*p
The loop frame reference of impedance form is

Vto,p : [Zrrop) Ir-oop

Comparing the equarions (1.42) and (1.43)

as

,[Ii*p]r

Power Sustem Netusork Matices .15

IZuopl = Cr [z] C
After calculating 'fZrooo]' next from this expression we can calculate '[YLoop]'.

...(1.44)

This is given by
[Yr_oop]

1.9

[Zr_oop]-l

{Cr tzl C}-1

NON-SINGUUTR TRAT{SFORMATIOil METHOD

By using non-singular transformation we can determine branch and loop impedance matrix and
admittance matrix for the primitive network. But in this section, we discuss about the branch
impedance and admittance matrices only.

1,9.1

Determination of Branch Admlttance and lmpedance Matrices

Consider the augmented incidence matrix, the augmented network is obtained by connecting a
fictitious branch in series with each link of the original network.

Fictitious node

Fig. l.12
The admittance of each fictitious branch cannot allow altering inter-connected network, its
admittance is set to zero. The current source of fictitious branch carries the same current as the
current source ofthe link so that the voltage across the fictitious branch is zero. A tie cut-set, can be
treated as a fictitious branch in series with cut-set containing a link.
From the branch frame reference form of performance equation

lln,l

...(1.4s)

[YnJ [VsJ

The performance of primitive network is given by the equation (1.7)

r+i;tJlV

as

...(1.46)

Pre-Multiply the above equation on both sides with [B']r, we get

lBlr, + tBlri :

...(r.47')

[B']r Dl v

ol
n,:fU' url

We know,

LB,

Substituting this in equation (1.47), we get

[';

]1lt?1.[? l:][f]

But

[? fl] ,, ,,

,,.l + [u,i, + BI i,-l:Lor,

[u, sl.l D] . tv,
"o+u,il,'l'L
o+u,7j

Iru, + t_B.l
L

[UD] iD

.l

: i6,U1it:

it

...(1.4r)
...(1.4e)

16

Electrical Pouser Systern Analysls

IUalit = ju,Urit: jr
Substituting these values in equation (1.49)

+ nf i,1 ,l j,+ e,'r,l _

[i,
"'
I
lrl

L ,, I L

wlrere

i,'

):

[u, Bfl ...,

.,,,
DI tvt
u,_]
Lo

+ Bf i, : [Br] i = 0
ir, + Bf ,it: [Br1i = Ir,

...[1.s1 (a)I
...t1.s1 (D)l

ib

Substituting equations [1.51 (a), (D)l in equation (1.50)

:
[;].[?] [? ";] ,,,,
:
[,T;] [? fl] ,, '",
I ln, I

...(1.52)

1,,*r;l:'u'

where

[,,,]

[?

'ul] ,,ru,

i, + j, is the total source currents of a fictitious branch and its associated link.
Is,

[Br] DI tv1

and voltage across fictitious branch is zero. So the voltage vector of the augmented network is Vs.

And the voltage across original network is

V:

[B] [Vsr]

IB'1 [VB,]

Substituting equation (1.58) in equation (1.56) then

Ie.

[8,]r DI tBl [VB,]

The pertbrmance equation of the augmented network is

(v*
comparing equarions,,

.:;,

[Yr,J

;!",T)

: tB]r t vl tBrl

'fhe equation (1.61) can also write as follows

Y,l : lu, BII [y.

["o yol
Lv.
I o u,l [r"

yal [u,
y,.]

l
Ls, u,j

lu') :Primitive
admittance matrix
- : fy'
lfu, lu )
Itu,l : Primitive admittance matrix formed by branches
Dtl : Primitive admittance matrix formed by links
D1

Pou:er System Nefiuork

Iyrl : D,r]' :

Yrl:

[Yo

1"" ",.1

I yuo

*Bl y,u ]r, + BI y,,l [U,

- [[rr,
Yrl
Lv.
L

e,:

!ur, + Bf yu
lut + BrrY,

Ys:
Yc=lt*)z'B

mutual admittance matrix formed by branches and links

trt .llt,

I ,*

[Yo v"l

Matrices 17

BT y,u + lnt Bt +

Bf n,

yn+ruB

I
u,l

B,] [r, * gl y,,]l

lu l

* lutBt + B/ (y,,) tB,I

...(1.63)
..(1.64)
...(1.6s)
...(1.66)

'.

Yo=)a
But from singular transformation method,

[Ys,1

[Brl tyl tB]

: [u,

,r][;; i;][::]

= ltoo+ BI vra

)ar +

BI ,rt

[]]

= !u, *Bl y* + lat Br + Bf y,, B,

...(1.67)

From equations (1.63) and (1.67)

.

rhe branch impedance L]i";,I.1,;Lined by

lZsJ: [YrJ-' : [Ye]-l

LlO

..(1.68)

...(1.6e)

DTRECT INSPECTION METHoD FOR DETERMIilATION OF 'YBUs',

By direct inspection of the network, Yru. can be obtained for any network,

if

there is no mutual

impedances between elements.

Apply the Kirchhoff's current law at every bus for developing the bus admittance matrix. In this
nodal equations are developed for every node except for the reference bus, which is
oormally taken as ground bus. Let us write the nodal equations using Kirchhoff s current law for the
oetwork shown in Fig. 1.13.

.ay, iy.t"matic

Fig. l.13

18

Electrica| power

Here

'I,'

Analysi.s

'Ir'

and
are the extemal current sources at the bus '1 and
3'. In the nodal formulation,
the voltage sources with the series impedance, which
is usuaily the case in the power system netwo

are replaced by the equivalent current sources with

shunt irnpeoance by the following method.
The two sources are equivalent if

(l) Ee : l,Z,
(ii) Zo:7r
zs

zL
VL

Fig.

l.l4

ld.cnl rtobagc sowrcc

Fig.

l.l5

ldeal cuwent

source

Now consider Fig. 1-13 and applying Kirchhoff's current

law at the buses
obtain the fbllowing nodal equations

1,2

and3. We

: Vr )r + (Vr -Y) yn
0 : V, lz + (Yz- V3))zr + (Vz -yt)yn
Is : Vr): + (Vl -yz)yzs
Ir

ylttt
'0'

vr and v, are the voltages of bus 1, 2 and 3, respectively with respect

J.,'
to the reference
and these are also known as bus voltages.

: lii. i'e.,!tz:

The admittances)ii

)rr since network elements are linear and bilateral.

Rearranging equation (1.70) and separating co-efficient
of bus vortage variabres (vr, v, and

: ()r -ln)yr_ joyz

O : -lzr Vr * ()rz *
lz * lzt)yz_lztyt
lt: -lzzyz * (jzz + ):) Vs
!r * !n: Yn
ln * lz * lzt: Yzz
:"zl * ll: Y3:
Ir

Let

...11.71

From the above equations it is clear that

Diagonal elements

sum of the admittances of the elements that are creating the

node.
off-diagonal elements : Negative sign of admittance between
the adjacent

t.e.,

nodes.

yr2 =

Jtz,yzt: _y23andyr, : _)13

Diagonal elements are called self admittances of the node
or driving point admittances. The
diago,al
_

elements are calred mutual admittances or transfer admittances.

Substiruting equarion (t.72) in equation (1.71)

Ir = Yrr Vl + yt2 V2

0:Yz,Vt+yr2V2+y23V3
lr

Y:tz V2

+ y33 V3

Power Sgstem Nehoork Matrier':s 19

rhese equarions can

_;:T.,;l::"

".*
T:,_T?;:1"

IoI:l"r, Y, r, llv,

*
...(1.74)

1,,] [ o Y,, v,,,lLu,]

From the,above discussions we can write the 'Ysu.' general form for any power system network

with'n'

buses (n

1 nodes) as

follows

[],I [Y,, Y,,

Y,,,-l

I ,,

v,,, I lr,

I 1",, Y,,

[v,l
I

The elements of bus admittance matrix can be form as follows

:
Y, :
Y1;

...(1.7s)

Sum of the admittances of the elements that are creating the node at bus

Negative sign of admittance between the adjacent busses

'i'

and

'i'

J'

...(t.76)

Itbte

: (l) The 'Ysu,' matrix

between the elements

(i0 The 'Yru.' matrix can be

,I 'I'I

can be found by direct inspection method provided mtitual coupling

system network is neglected.

of the given power

developed

by direct inspection method, but not in the case of 'Zsor' matrix.

DIRECT INSPECTIOT{ METHOD FOR DETERIYI]NATION OF 'Z,OON'

In this method the elements of loop incidence matrix (Z1oor) can be calculated directly by inspection
md hence 'ZLuop' has direct correspondence with the given primitive network.
I-et us take the one example for solving 'ZLoop'by using direct inspection method.

The elements of 'Z.oor' matrix are developed by applying Kirchhoff's voltage law and writing
bop equations of the given power system network. However if there is any current sources in the
retwork that is replaced by equivalent voltage source with series impedance.

n
ll

l2

Fig. l.16

Writing the loop equation by using *O.n

Et-Ez:IrZr + Gr _ I)22 + (It_\)24

E2-\:
0:

Separating

...U.77(all

- t)22 + tzz3 + (12_\)Zs

(Ir -I)Zt + (Ir - 12)Zs +
\26
the coefficients of loop currents I,, I, and
13, *" g"r"
Er _ Ez : (Zr t 22 + Z) _ Zzt2_ Z3I3
\

Let the impedances

(Iz

...tL.77(bfl
...tt.77(c)l

Et _ Et _ _ zt\ + (22 + 23 + z) 12 _ zst3

O : - Z+\ - Zsl2 + (23 + Zs + 26) 13

Zrt:

Zt + Zz +

Z',4

Zzz:h+23+Zs
Zts: Zq + Zs + 26

Zo:Zzr--22
Zn:Ztr--24
Zzs:Zzz--Zs
The resultant loop voltage sources in loop

.l'

is

V1:E1-E2
The resultant loop voltage sources in loop .2' is

yz:Ft_Et

By using above assumprions, equation (r.7g) can be modified

as foilows:

Yt: Zrt\ + ZnI2 + ZBI3

Yz: Zzt\ + Zzz12 + 7.2313
0:Zzr\+23212+Znl3
Write equation (1.82) in matrix form

l-v,l lz,, 2,, zu1(t,\

2,, ,"llr,l
lr,l:
lr,,
o
z* z")ltr)

Lz,

From above discussions we can write the elements of loop impedance

matrix as follows
2,, : Sum of the impedances of the elements forming the loop .i, : Diagonal
elements
2,, : Negative sign of impedance that are conrmon to the loops 'i' and
: off-diagonal

2,,
l',, z*

. lloon'7 - lzrt
1...
Lr,, znz

r'

z,,f
zr,l
...(1.
I

2,,)

Diagonal elements are called self impedances of the loop or driving

point impedances. The
liagonal elements are called mufual impedances or transfer i*p"d"r..r.

sowED PROBLEMS
hoblem

l.l.

For network shown in Fig.

I.l7

draw the graph, fromthatfind

Ai A, B: B, C', C, K

o+
J)
Fig. r.r7
Sol. For Fig.

1.17(a)

Numberofelements, e:9
Numberof nodes, n:5

+ l:6/

,/

Numberofbranches,b:5
Number of links, I : 4

fi,,,r
a/1L
@

Fig.

I.l7 (a)

Graph

ry29

/*fr'*c'd)
Lu- ntol,r/ /t

,, @
vfiuou,n "(,_7

Element node incidence matrix (A') elements can be obtained from Fig. l.l7 (a) as follows
ai : l, if the id' element is incidence and oriented away from the j6-node.
ou : - 1, if the ith element is incidence and oriented towards tne;m-i"Oqe.
oi : 0, if the ith element is not incidence to the je node.
Node

2
J
4

A':

6
7
8

'1

.-1 0
0 1 -1
100
100
000
000
001
001
000

00
00
10
0 -1
01
11
10
00
10

0
0
0
0
1

0
0
1
1

For obtaining bus incidence matrix (A), eliminate the reference node column in A'.
Bus incidence matrix (A)

@o

Element

-1

[:

,5

5I
6I
7|
8I
9|

0
0
0
0
0

0000
-1 0 0 0
0 -1 0 0
0 0 :[ 0
0 0 I -t
0 -1 1 0
1 -1 0 0
1 0 0 -l
0 1 0 -t

@Fig.

l.I7 (b)

Tree

Branch path incidenle-qatlix (K) elements are obtiined from Fig. 1.17 (D).
Puh

Branch

I
2

K_

4
5

-1
0
0
0
0

-1
-1
0
0
0

0
0
-1
0
0

0 0
0 0
0 0
-1 -1
0 -l

Basic cut-set (B)

The elements in this matrix can be found as follows from Fig.

11

l.Ll (c)

,r'

) \,'

f,

Fig.

f.f7 (c)

Cut-set

B, - 1, if the ith element is incidence to and oriented in the same direction as the/ basic cut-set
B, : - l. if the lth element is incidence to and oriented in the opposite direction as theT'fr basic cut-set
B, : 0, if the ift element is not incidence with theTs basic cut-set

Cut

rll
2l0

0 0

1 0

310 0 I

4l0

slo

610

0 0

0 0

0 1-1

7 l-t -1 I
8 l-1 -1 0
910 0 -1
Augmented cut-set matrix

tj

(B)

Cut-set
Element

A B C,
lll
0 0
2l0
1 0

310 0 1

B':

4l0
0
5|o o
610 0
7 l-t -1

D
0
0

0
1

1-1
1 0

8l-1 -1 0

9 I 0 0 -t

Elr
oiO

010
010

-4

ta'

0
0

010 0
liO
0
--+0
100
0

010
001
000

0
0

0
1

Basic loop incidence matrix (C)

The elements can be found as follows from Fig. \.fi (A
: 1, if the element is incidence to and oriehted in the same direction as theTe basic
loop
9,,
is incidence to and oriented in the opposite direction_as trreT; uasic
toop
C,j : 0,1;'lln:.:,_:."-ry
if the element is not incidence to theTs basic loop
G 1,2,7,3
-+ 7 as link

!, : ;

I 9, 5, 4,3
H L,2,8,5,
F 3, 4,6

-+
-+

link
link
6 as link
9 as
8 as

Fig.

r.l7

(d)

24

Electrical power System Analusis

't
2

c-

4
5

6
7
8

FGHI

0110
0110
-l -l 0 I
I 0 -1 _l
0 0 -l -1
1000
0100
0010
0001

Augmented loop incidence matrix (C') eremenrs are is

obtained from Fig.
I-oop

c D El. c H
{ 0 0 0i0 I 1

fl
t',;'.

u'
\

-1\

\ Cb \

( t2Yuo)

(,' -\-O
\-/

llt
210
I 0 0 0i0 1 I
3 J0 0 I 0 o l_r _l 0

r
0
0

tlo ,o o o olo i o

8,1

0 o 0 0 0lo

elo
'

r.r7 (a

0 0 0 0i0

0 I

0 0

o
0

Probleml"2' ForthenetworkshowninFig. l.Isdrawthegraphandtree.Alsodeterminethe

matrix by direct inspection method. All the meniloned valuei

aie

20t60"A

jl0

j10

+j5
+j5

i*pra"irri;;;.;:.

+ j20
+ jZO

20 230" A

Power S-r,rstem Network Malrices 25

Fig.

l.I9

(a) Graph

Fig.

t.I9 (b) Tree

From the graph shown in Fig. L.I9 (a)

n:5
elements, e : 8
Numberoftreebranches, b: n- 1:5 -l:4
Number of nodes,

Number of

l=e-n*l:8-5+l:4

Number of links,

Therefore 'Yrur' has the dimension of '4 x 4'

Given values are impedances and are given in p.u. quantities. We can determine admittance values
and then form the 'YBu.'.
The elements

:
Y, :
Y,,

For

of 'Ysu"' can calculate

as follows:

Sum of the admittances of the elements that are creating the node at bus

Negative sign of admittance between the adjacent busses

i,7 =

1.

2,3

'i'

arrd'j'

and 4

Diagonal elements'.

Yrr :./0:1 + j0.1 + 7O.05 : j0.25 p.u.

Yzz: jU.L + j0.2 + j0.2: j0.5 p.u.
Y3r: j0.1 + j0.2 + JO.05 :70.35 p.u.
off-diagonar erements

,"

t.

tz
Yr3
Yr4

:7o'05 + 70'05 + Jo'05'

:
:
:

Y2r
Ygr
Y4r

:
:
:

- 70.1 p.u.
0.0 p.u.
-7O.05 p.u.

Y23:Y1,2:-j0.2p.u.
Yzq:Y+z:0p.u.

Yl+:Yar:-j0.05p.u.

i0"J5 ptu'

'i'

26

ElectricalPouerSystemAnalysls

0 - j0.05
I j0.25 - j0.1
0
| -;o I jo.s - j0.2
rBu':l

j0.3s - j0.05

-jo.z

l-;o.os

j0.05

i0.1s

Problem 1.3. For problem 1.2, determine the elements of 'Zurp' by direct inspection methdSol. Here we have to replace the current sources into equivalent voltage sources when applying
direct inspection method.
The elements of loop impedance matrix as follows

:
2,7 :
2,,

Sum of the impedances of the elements forming the loop .f,

Negative sign of impedance that are common to the loops

,i, ad,

Diagonal elements are

Z,:

1725 p.u.

Zzz: * 720 p.u.

Ztt: * 750 p.u.
Z++: * 755 p.u.
and off-diagonal elements are

Zrz: Zzr: - j5 p.u.

Zn: Ztt:
Zu: Zq:
Zzt : Ztz = Z+z:
Zy = Zq:
Zz+

0 p.u.

jlO p.u.

-710 p.u.
- j5 p.u.
- j20 p.u.

l+1zs -js

.7
-js +j2o -jro
aloop _l
I 0 -ilO +i50
L-j10 -js -j20

jl0l

_rsl
j20l

+ jss_l

Problem 1.4. Determine the incidence matrices A, B, 8,, C, C' and

,following relations shown in Fig. 1.20. Take I as ground bus.

(i) ct -_- BI i
(iii) At) { : U and

(ii)
B,T = U
c,B,T:
t
r,fi C,
(iv) B,
B,:: Ar
A,I{
{

Fig. l.2o
!

K. From that verifi

Power SgstemNehaork Matrices 27

Sol, Number of nodes, n

Number of tree branches, b

-|

:4-I=3
l:e,-n*l
:4-4 * 1:1.

Number of links,

Assume node (D as reference

From Fig. 1.20 (b), Bus incidence matrix [A]

Fig. f.20

-l

A-

,)

-1

o ol
eu:l|--r
0 -t 0l
I o I -r.l
A,:[l 0

(a)

Grapb

-1 l^,
--- )A,
-1

-1]

From Fig. 1.20 (b), Branch path matrix (K)

o@
K-

0
0

2
3

Fig. I.2O

(b)

Tree

-t -l
0 -1

From Fig. 1.20 (c), basic cut-set incidence matrix (B)

ABC
I

-l

4
I-r

,r:lo
lo

Br: [- ll

I
0
1

tl
rI

0t

o fs,
rJ
I )8,

Fig. r.2o (c)

28 ElectrimlPower

SgstentAnafusis

From Fig. l:20 (Q, Augmented cut-set incidence matrix @')

A B C IN
1

B':

2
3

o olo

o 1 or6:[*]+]

o o 1lo

B,=[-111]

U,:

and

rig. r.20 (d)

[lJ

From Fig. 1.20 (e), basic loop incidence matrix (C)

c-t>

C:

2
3

-1
-1

l:
)c,

--A-\

I-'11

c, =l-tl

Fig. r.20

L-il

and

C,

= [1]

From Fig. 1.20 (e), Augmented loop incidence matrix (C)

A B C IO
10011

0 l-r

o r i__l-r

000;1

.,:i-il
Verification

(i) Ci,--B1
From the matrices C, and B, r,alues

Ca:-BlT

cal

I
-iua
-LT-TI[]

(e)

(ii) c'B'T: u

00
10
01
00 il
100
010 :l
001
:l
1il

C':

B':

l-1

0 0 -ll

,":l: ;:

ll

Looo,l

l-1 0 0 lll-l

-r.l

tl
tl

_lll: ; r
;i
lo o o lllo 0rl

.,,rr':ll

[r o o ol
:ttlo 1 o ol _U
lo o r ol
Lr o o ,l

C'(B)T _ U

(iii) AbKr: u

[-r o ol
Ar:l o -l ol
I o r -rl

:fi

":fi ; -j]
-i l]
A' c:fi
I :]fi -i l]
=*

ElectricolPower

temAnalgsis

:[i

001

0l

0 r.l

,4,6KT: U
= ArKr

(iv) Br

A,:[t 0 _t]

[-r o
x':lo| -t
L

0 _l

ofl
I

0l
_l_l

[-t o ol

l--rl

A,Kr:[l o -r]l o -l ol:l tl :Bl

I o -r -r_l L ,j
Problem 1.5. For the graph
verify the following relations :

riiit

shown in Fig . L 2l , form the necessary incidence matrices and

3

A6I{:U_

ir: - BI

Gi)

n-l
b:4-l
-3
=e-n*I
:5-4*l:2

Sol. Numberof branches,b:

Numberoflinks

Bt:At{

(iv) c,(B)r

: s a(

From Fig. 1.21, Bus incidence matrix (A)

Eig.

A_

From Fig.

l.2l

Grapb

I^,

[-r o ot
Ar:lo o _ll
and

l.2l

)o,

e6

r -r ,]

l-r 0 -11
o':1,
-r il

(a), branch path matrix (K)

Fig.

I.2l

(a)

Tree

Power Sustem Nefioork

(:

001
0 -1

From Fig.

t.Zl (b), basic

icccut-set incidence matrix
Cut

ABC

B-

0'r

lJ

-r

(B)

0Llr,

0 ir,
I )'

-l

I ol
'.:l
Br:lt--1
:
1 1 -r r.l
From Fig.

l.2l (b).Augmented

I
0
0
- I -I

B':

4
a
J

Fig.r.2l(b)

cut-set incidence matrix (B')

Matires

C IO

0 010
1 010
0 I l0
I --0-T-l-1 I I

lurlol

- Lnr lurj
_ l-J-l

l--l I 0l
s,:Ll
_l tl
From Fig.

l.2l (c). Basic loop incidence matrix

(C)

1",
},,

.":
-'From Fig.

[-l_il

l-l

Fig.

L-;

l.2l (c), Augmented

loop incidence matrix (C,)

r.2I

(c)

31

:[u,o lcrl
I

Verification

(i) AaKT:

l--

001

er:10 o -rl

Ir -t

[-r o ol
-rl
-l ol=xt:l o -r ol
o-rl L-r o-,1
o

[-r
K:10
L0
[- r

ArxKT: |

o ol[-r o

-r

R.H.S.

Ar

0
: [r
l0 r
loo

Kr

[1 1
A,=l
'
L0

-1

-11
0l

[-r o
rt:l o -t

f-r

o
o

o -r l
-l--r o ol
[to -'ll
o
ol :[-l
[o -r olL_,-r
_rl
o
R.H.S.

(iii) cb--n/

_r, .

l0l l:B,

-1 lj

L.H.S.

l--l
B,:
' Lr
I

ol

o -,ll o
ol
-1 0lL-l 0 -tl

lr

(ii) Br:

ol

-l

r-1.l

L_; ll

Cb.

lur.]

Power SgstemNefitnrk Matrices 33

(iv) C'(B')r

100
0 10
C': 001
000
000
I 00
0 10
(B')T

: 0

0I

1 -t
-1 I
0 I
1 0
0
-t I
I -1
1

0\

1 0
000
000
0
100 1-1
I
010-l
I
C'(B1T : 0 0 1'0
000
10
000 0 I
10000
01000
:10 0 I 0 0l:
1

I 00
0 l 0
001
000
000
U

-l

I -1
0
1 0
0 l
1

Unit matrix.

000r0
00001

Problem 1.6. The incidence matrix is given below. From that draw the oriented graph.

rO

Branches

nodes

AT:

@
@
@

2345
678
100
01001
0 *t I 0 0
0Jq
001
0 0 -1 I -l
000
1 0 0 -1 0

Sol.

Eig. 1.22

Problem l.T.ForFig- 1.23' theimpedancedatais giveninTable l.l.

Alttheimpedancevalues
yr^ matrices by singulaiTransformation method.

are in p.u. values. Determine

Fig, 1.23
Table 1.1
Element

Bus Code

Self impedance

inp.u.

0- I
0*2
0-3
0-4
I -2
2-3
3-4
1-3

2
3

4
5
6

7
8

Sol. From Fig. 1.23, the Bus incidence matrix

^A,

0.1

0.2
0.25
0.5
0.1

0.4
0.3
0.6

is

1000
0100
0010
0001
A_
l -l 0 0
0 1 -l 0
0 0 I -l
I 0 -l 0
Primitive impedarce marrix is
Elementsr-+ I
2
J
2
3

4
5

T
8

0000000
00.2000000
0 00.25 0 0 0
0000.50000
o 0 0 0 0,1 0
000000.400
000'
0000.30
0 r0 0 0..00
/

.j

0.6

i
i

Foroer Sysffi"iYettuorft

Primitive admittance is given by

Y:

v:

[zl-r

0J0
00.2
0 0
000
000
000
000
000

0
0
a.25
0.5

0 0.1
0 00.4
0 0 00.3
0 0 0 00.6

r0

I
i

05
004
0 002
y=
0 00010
0 000 0 2.s
0 000 0 0
00000001.67
YB,.: tArl DI tAI
100 00

3.33

0 0 0 0
05 00 0 0 0 0
00 40 0 0 0 0
00 02 0 0 0 0
IJ] [A] :
00 0010 0 0 0
00 00 0 2.5 0 0
00 00 0 0 3.33 0
00 00 0 0 0 t.67
10000
0s00
0040
0002
10 -10
0
0
0 +25 - 2.5 0
0 0 3.33 -3.33
+1.67 0 -1.67 0

100
010
001
000
1 -1

0
0

I
0

I -i

0
0

0 0 I -1
1 0 -l 0

IftfB

36

Elrcticalfuwer

yo

l0

00 I 0 0 1l
lo
I 0 0 -l
I 0 0l
tArl Dl [A] =
lo o I 0 0 -l I -11
Loo 0 I 0 0 -l ,l
l-1

50
04
00
-10

0
0
0
10

2.5

0
0

0
1.67

[(,0*lo+1.67)

:l

-ro
-r.ot

Lo

I zt.et
rBus

| -,0

- |
-r.u',

Lo

10

-3.33

0
0

,
0

-2.5

3.33

-3.33

-1.67

1.67

(s+ro+2.s) -z.s
- z.s (+ + z.s +3.33 +1.67)

- 10 - 1.67
t7 .5 - 2.5

0
0

-2.5
- 3.33
0 - 3.33 5.33
r2.5

koblem l.E. For the system shown in Fig. 1.24, construct yru,
method. The parameters of various erements ari given;rir;,;;;.;.

by singutar Tmnsforn

f;i;'*;'?;,}

Fig. 1.24
Table I.2
Element

r-2

t-6
2-4
z-J

3-4
4-5
5-6

,r{,;,]

Reactances in p.u.

0.u
0.6
4.03
0.02

0.8
0.06
0.05

uyirrn"r,

Sol.

Fig. 1.24

(t\

ELg,.

Oriented' grnPb

L.24 (P)

Tree

Element node incidence matrix (A')

o@o@
I -1 0 0

1
0
0
0
0
0

A,=

4
5

6
7

0
1
I
0
00

0
0
-1
1
0
0

0 0
0 0 -1
-1 0 0
0 0 0
0 0
-l
l--_1 0
0 1 -1

deleting
Fromtheelementnodeincidencematrixbusincidencematrixcanbedetermined, i.e-,by
(6).
the row corresponding to reference node
Bus incidence matrix (A) is

e@o@o
1 I 1 -1 0 0

0
2l1
3 I O 1

{:

4 I o
s I 0
6 I 0
710

The bus incidence matrix

\t

I -1 0
0 1 -1
0
0

0
0

0
0
0
0
0

I -1
0 I

(A) is rearranged by separating branches and links

o@o@@
I I -1 0 0 0

,-(-l
e

0 0
0 -1

\2/

I
o
0 0
0 o
211
zl1 o
0
1 -1
0 1
4 II o
4
-1 o

o
o
0

6 I o o o 1 -1

--3-T

s I 0

A, (Branch)

o -r o i Ar ( Link)
1' -1
-1 o
0

as

follows

gg

Elecffirr:rtfuu:er

Primitive impedance matrix is

j0.04

0 j0.06
0
0
000

j0.03
j0.02

0 j0.08
0 0
000

i0.06

Primitive admittance matrix is

i0.05

lzl-l

- jzs

0 - j16.67
00
- j33.33
00
0
- iso
00
0
0 - jtz.s
00
0
0
0 - jr6.67
00
0
0
0
0 _j2o

y:

YBu,: tAT] DI tA]

11 0 0 0 00
-l

[A]T DJ

: -I 0
0
0

tArl DI

-J

[A]:

0
0
0
0

1 I
0 -1
-l 0
0 0

0 0
I 0
_1 I
0 _t

0
0
0

25

0 16.67
0 0
000
000
000
000

33.33

25 16.67
0
0
-25 0 33.33 50 0
0
0
00
0 - s0 t2.5
0
0
00
- 33.33 0 _ 125 16.67 0
00
0
0 0 _16.67 20

-,r

25 t667 0000
-25 0 33.33 s0 0
0
00
0 -50 125 0
00
-33.33 0 -12.5 16.67
00
0
0 0 _t6.67

50

0 12.5
0 0
000

0
0

0
0
20

1667
20

I -l 0 0
1000
0 I 0 -1
0 1 -1 0
0 0 I -tr
0 0 0 1_
0000

fuwer Sgstem,Netunrk kfiatrires 3g

''

(zs + to.ot)

_25
YBr,

-,1

-zs

+::.r

(zs

+ so)

-50

0
0

33.33

- 25

108.33

00
-50

koblem
Fig.

.25

-33.33
-12.5
(33.33 +12.5 + 16.67)

12.5

16.67

16.67

(a.at + zo)

-3333

0 -50 62.5 - 12.5

0 - 33.33 -125 62.5
00
0 - 16.67

it

(so + rz.s)

4167 -25

0
50

0
0

-16.67
36.67

1.9. Determine the Ys^ matrix by SingatnrTransformntion methodfor the network shown
The parameters are given in Table t .3.

Table 1.3
Ele'ment

Self impedance in p.u.

Bus Code

p-q

t-2(1)

2
3

3-4

4
5

Impedance

Zrr-*
0.2
0.4

t-3

Muttml impedance in p.u.

Bus Code

r-s

1-2

(1)

Impedance

z*_r,
0.05

0.5

1-2(2)

0.25

2-4

0.2

Fig. I.25

: J
Numberofbranches, b:n- l:4-l
=3
Number of links,
l:e-nll:5-4*l:2

Sol. Number of elements, e

1-2 (1)

0.1

Anafusls
Element-node incidence matrix (A')

I -1
l0
00
1 -1
01

I
2

A'-

4
5

00
-1

tr -l

00
0 -1

Bus-incidence matrix (A)

-1
0

('.'

-l
0
0
-l
I

[:
Primitive impedance matrix [z)

0
-1

1 -l

0 0
0 -l

ele L

1 102 0.05 0 0.1 0

2 IO.OS 0.4 0 0 0
310
0 05 0 0
4 l0.l 0 0 02s 0
Primitive admittance matrixy

o,

o ol oI 0

0'2J

o: foos /o o.r

o
,loor@o
y:[z]-,:l 0 0 0.5 0
;

o -l
o
0

0.1 0 0 025.0
000002
To calculate
Method I :

al

ttrere arc two methods

0.2 0.05 0 0r
Y:

[2]-r :

0 -l

0.050.4 0 0 0
000.500
0.1 0 00250
000002

is reference

fuwa SgstemNetworkMaffies
Stcp 1. Interchange rows 3 and 4

0 0.1 0 l-t
0l
0.400
0 0025
00.50
000
J]

0.05

02
0.05

y'=

0.1

0
0

Step 2. Interchange columns 3 and 4

oe

0.0s 0.1 i

0 -l

0.4 0 i0
0.1 0 02si0
-0 ---0----0--l
I

0.0s
y"=

--:-----------l----

0
0

05--

0 0 0lo

02

Step 3. Above matrix can divide into 4 submatrices

oz o.os o.l I
0.4 o
Lo.r o o2sl
I

Al: lo.os

A2=

fool
roo
ol A,=lo

lo
LOOI
o-l
A,: [05 oz)

0l

,]

Lo
l- o.s - osr -zs1

A,-'

: | - o.r, 2.6

L -z.o 033

033

5.ol

Ant: 12 0l
L, rl
Step 4.

',-: h-l-11-,-l
La, ia;'l
65 -08r -2.6 0 0l

-o8l 26 0.33 o ol
t''= -26 033 5 o 0l

o o2 ol

o o

oos_l

[4, ierl
LAr iArl

41

42

E:leetir:"\ryunr SgsternAnalysis

Step 5. Interchange cofunrns 3 and 4

-081

6.5

v':

2.6

0.81

-26

0.33

0.33 0

-2.6

02
00

0
0

Step 6. Interchange rows 3 and 4

6.5 *081
0.81 2.6

0 -2.6 0
0 0.33 0
y : [2-1] :
0
02
00
0.33
0
50
-2.6
0
00
05
Limitations : This method is applicable only the matrices
zero's only. Otherwise it is not applicable.
Method 2

A,

and

A,

are having the

02 0.05 0
0.05 0.4 0
000.5
---o---

y : [2-1] =

dl

000

0.1
00

0b

0.25 0

002

Let

s,l
[r,
[o, o,1-'
:
Lo, eol Lr, B*l
The values of matrices 81, 82, 83 and 84 are

Br

o*-,:

[Ar _ (Az A+-r Ar)]-1

[o;"

;]

[o.r ol

[; I

e,:lo
- lo ,lol

A^:l l-0.1 0 0t

' L0 0 0l

A,Ao-,":

ltt

;] t;

0 -l

:lt'J

: 3l

[A, lArl-'

t ---F---

LA: i Aol

Power Systetn Netwo* Matrices 43

o ol
l, olIo o ol
Lo oJLo o ol
[o.o+ o ol
I o o ol
l-o o ol
I-o.a ol l-0.1

lAr - (Az

Rt'

oz

ll

a;-'

o.o5

[o.o+

o oll-'

tlt' eJ ,:l L: : :ll

l-o.ro o.o5 o l-'

L'f'T
l-

os

l-orr

Bt

J,j

- o.8r ol

2.6

Lo o

ol
z)

82: - B, A, A11

:;: :]

[,;r
l--

o.s 0.81 0l I- 04

L'f'
l-2.6

B2: lo:z+

Lo

:JL

ol
o

oJ

^ l-2.6 0.324 0l
&':Lo
, ol

B+:

Ao-'

- (e;' e, nr)

Lo

:t

",

:
l-0.4

-lo
_l

ol

: :]

B3:

.14

Ao-'At

tT :lr;

tT : :t[-i1 l]

-l - z.e ol
o ollorro
o oll o ol
ol

:l

Elrcticalkru:q

:l

l-- 1.04 0l

lo

o,l

Ba:A+1-(Atl

:[;

A3 82)

I i 00

1.04 0

!:z':Lr,

0 -2.6
0 0324
20
0 5.04
00

6.5 - 081
- 081 2.6
0 ,-0
-2.6 A324
00

B"l
.t _

[Bt

-r

I-s.04 0l
:lo
s]

Bnl

0
0
0
0
5

Next after.calculating primitive admittance matrix,

YBu,: tArl Dl tAl

YBr. :

o o -l

rl - 0.81 2.6

- 2.6 0.33

h' -r I o 0l
Io 0 -l 0 -u

033

002

o.e +

=|

zs

0.81

o.8t

Lo

000

0.33

-2.6

-2

2.6

0.33

il

-l

l2

0.48

= lo.8l

-26

L0 o
I o.+

lBus a,
zBus

o.+a

L _,

- IYuur]-'

2.6

0.33

-2

T -l

- 0.48 - sl

4.6 -rl
-2
: {[Ar] tJI')IAI]-'

l- o.+ - 0.48 - sl
| - o.ot
4.6 -Zl

-'

.,

L
|-

lBus - I -

l-

o.zs

-2 ')
- 0.116 - 02081

0.,,u
o.rot

- 0.1e3 - 0.028
- 0.028 - o.ol4l
I

00
-l 0

I -l
00
0 -1

-l
1

0
1

-t

00
00
05

-t
l-

l0
0 -l 0
0t -l
10 0
10 -l

06 - 0.81 0 -2.6 0

0
0

-l
0

-l

Problem 1.10. Determine Ys^ matrix for problem 1.7 by direct inspection method.
Sol. Diagonal elements

1:
+ t.67 :21.67
" :l*l+
0l 0.1 06 10+ 10
I
y..:l*!+
z1 0.2 0.1 o.4 :5+10 t2.5:L7.5
I *!*l
y..=
:4,-2.s +3.33=9.83
0.4 0.3
025
'r
:2 + 3.33 = 5.33.
Ytr=
#.*

y,,

Off-diagonal elements
I
yr2:Yzt:-ut:-to

Yr3:Y3r:--#:

-1.67

Yla:Y+t:0

yzz:y32=-#:.
Y2+:

Yaz

r.t

L
Y3+:Yur=-0.3

-3'33

-10 -t.67 0 I
l-10 r7.5 -2.5 0
12r.67

V:l
'tsus

-t.ot -2.5 9.83 - 3.331

L o o -333 s33l
|

l.ll,

\'he network shown in Fig. 1.26. Draw graph and ffee. Determine the Yau, W
inspection method and verify Ysurby nodat equation analysis. The admittance values are given

koblem

*c6

ip.u-

quantities.

- jl0
20

z-60"

j10

-j5

-js

Fig. r.26

-i20

- j20

20

z-30"

ebmeatfuruerSgrstemArulysts

sol.

l
1

Fig. 1.26 (a,\ Grapb

By lXr'ect Inspertion Method

Diagonal elements

ofr-diagonal etemen*

Y,, = -710 + (-ilO) + (- jZO): _ j40

Yzz : -j5 + (-i5) + (-jlo) = _jZO
Yrr = -j5 + (-j20) + (-j2O\ : -j4s
Y*: -i20 + (-i20) + (-ilO) = -750
Ylr = Ylz: -(-jl0) = +jlO
Yr3=Y31 =0
Yr+=Yar =-(j20):j20
Y::: Y3z = -(-j5): j5

Y2a=Ya-0

Yrc:Y+r:-(j20):j20

[-ioo iro o

-t;'
'lo
"*.: I
I izo o

j2o I

_'io,
j2o

,\l

- jso.l

Verification by Nodal Analysis Method

- j10

j10

-j5
-j5

- j20

j20

20/-30.A

fuuer SgsterrNefiuork Matriees 47

Let voltages

at

node@

V,

node@: V,
node @ : Y,
node@: Yn
Writing nodal equations for Fig. 1.26 (c)
At node@

(Vr - 0) (- j10) + (Vr - V2) (- j10) + (Vr - vJ C.120) :20 Z- 60"

v; t- j10 - jto - jzo) + v2 010) + v4 020) :20 t- 60"
- j40 vl + j10 v2 + jzov4: 20 l- 60"
At node @
(vz

- vr)

(- j10)

+ (vz - vi_Ljs) + (vz - 0) (-js) : 0

j10 vl + (- j10 -j5 -js) v' + 7i v3

j10vr +Gjzo)v2+j5v::0

At node @
(Vr - Vz) (-

...(1.86)

js) + (vr - 0) (= j20) + (Vr - V, (- j20) = 0

j5 v2 + G j5 - j20 -j20)v3 *720v0: g
75

At node

...(1.8s)

v' *

(-

i45\ v3 + i2o v+

...(1.87)

V2 (-

- Vl) (-j20) + (V+ - V) (-720) :

+ j20 vr + jz}v3 + (-jl0 - jz} - j}O) Y t :
+ j20 vr + j20 Y3 + (-j50) Y + :

j10) +

(V+

Z-30'
20 Z- 30"
20

20

z-

30"

...(1.88)

Writing the equations (1.85), (1;86), (1.87) and (1.8S) in matrix form.

l:l

l^'l-[In .]

iqo
.iro

;,0

lo

jrO 0
- jzo js
js - j45 ;L I
0 j20 -TsoJ [v. ]

[Ysu*] [VsuJ

ilo o
ljro -jzo js
rBus-l
i+o

l-

_l

lil

"

izo
o

o js -j4s j2o
t"j20
0 j20 - iso
L

Problem 1.12. For the graph given inFig. 1.27, draw the tree and corresponding co-tree. Choose
a tree and hence write the basic cut-set schedule.

(April/may 2005,2ffi7)

Eig. 1.27
Sol. Tree of Fig. 1.27 is shown in Fig. 1.28(a)
7

Fig. 1.28(a)
Corresponding co-tree is shown in Fig. l.2$(b\

Fig. r.28(b)
Cut-set schedule:

---'-l-.'-o.----.

Fig. r.28(c)

fuwer SgstemNetunrk Maffices 49

ABCD
1000
1-1
0-11-1
0010
0001
0100
00-t0

00

h,oblem 1.13. For the givm network shown in Fig. I . 29, draw the graph and tree. Write the cut-set
(April2005)
dtcdule.

, fJ

Graph of Fig. 1.29 is shown in Fig. 1.30(a)

Fig. l.3o(a)

dFig.

1.30(a) is shown in Fig. 1.30(D)

----?---

^v-----r----

@
Fig. r.3o(b)

etaregrtruwerslstenr
Cut-set schedule

A B CiO E
l
0

I
2
3

0
0

0 rio

I oil*- -.- - -:-0 -- 0=

-n-

0 -l

-l

0
0

o- 0 lio
-- --;1-1

0 0i0
I 0t0

li0

hoblem 1.14. For the network shown in Fig. 1.31. Determine

the incidence mntrices
B', B, C and C' and verify the followings:.

: U
4=At{
(iii)cb=-EI
(i)
(ii)

Ar,

Kr

Take node@ as reference and

I,

2 and S as *ee branches

Fig.
Sol. Oriented graph of Fig.

l.3l

l.3l

is shown in Fig. 1.32(a)

Fig. 1.32(a)

Ai

't
Tree of Fig. 1.32(a) is shown in Fig. 1.32(b)

Fig. r32@)
Element node incidence matrix (A')

xo

[A',]

Bus incidence matrix

Take

@@

-1 0
0-1
01
-1 ,0
-1 0

0
0
1

[A]

as reference node, delete column corresponding'to reference node.

@o@

IAI=

4
5

-1 00
\
0-1
'ol'1
-1 00
0l
-l

lonl

@@
1

A:5

-l

0-1
-l 0

0l

o1

ol
0i
1l =[
_I

it]

52 turri.",fuug-esrananatysrs
H@iri&ncmatrix [K]
km Fig. 1.32(b)

@o

l [-l

r:zl o

rlo

-r
o

1l
,l

I
I

iI

i
{

Fig. r.32(c)
From Fig. 1.32(c), the basic cut-set matrix [B]
I
2

B-

5
3

ABC
100
010
001
=[*]
---:l
l--- r
100

I
'l

{
I

Augmented cut-set matrix [B']

I
I

I
2

B,:

5
3

ABC
100
010
001
1-l-1
100

iI
I
I
I

DE
00
00
00
T---o

0l

tlt{
lll=l:i.

J,l
I

-----____l>

\D)

J
1

tl

l
I
I

Fis. r32(d)

Power SgstemNefitork Matr'rces 53

From Fig.
Basic

132(4,

the basic loop incident matrix [C]

loops:

D : 2, 3, 5, 1, 3 as link
E : 1, 4, 4 as link

DE
I I -l I
2t I 0
C:51 I 0
3l I 0
4t 0

=[i:]

Augmented loop incidence matrix [C']

I
2

C'=

ABCDE
1 0 ol-l
0 l 0i1
I

-1
o

li

0!0

Iu, I cr-l
Lo iu'I

The rearranged matrices for verification

ool[-rool

[-r

,,:

l-o

L,

[-r

Cr:

II

Ir

*:

; rl:l'

Aa: I 0
[-r

-r

o '

At:

o.l

L-:

I-o t

[-, o

1l
ol

(i) AaKr: u

tl i :lti ;

:]:[i

(u) Bl = Al Kr

i: 0'

-'ll-[-r
o
0ll

'L-l

-r
0

ol

:l

:[,Ir

I
0

ol

ol:u
'l

-r -tll:B,
00_J '

:j
tl
o.J

54

ElecticolfuioerSystemAnalysls

(iii1 go -

-Bl

[-r

-r

-sI:l
, I r ol:",
[r
I

o_]

Hence all relations are verified.

Problem 1.15- The graph shown in Fig. t .33, select@ as reference node and tree T
{2, 4,

Determine the incidence and augmented rnatrices. From these verify the
followings:

: 1,6r
(ii) Cb: - B!'
(iii) Br : - Ar Ail
(i)

B,

sol. Tree of Fig. 1.33 shown in Fig. 1.34(a) rree branches are given T
{2,4,5,6}

Fi$ l.3a(a)
Element node incidence matrix

[A']

A'=

-1

-t

-l

-l

o@o
0

0
0
0
0
I
-r

0l

0 rl
I 0l
0 -rl
-r 1l
I ol
o o_]

S,

Pouer Sgstem Network Matric.es 55

Bus incidence matrix

[A]: node @

as

referen.., .o delete the column corresponding @ in [A I

then

o@ @o
0 0l
I -l
0-l
0 rl
0 0l
0-1

I
2
3

10
00
00

A:4
5

0
I

-r0

-r

-1
1l

0l
0]

(oR)

o @@ o

0-1
100
000
001
1-1
0 ,-1
-r0-l

,|

4
5

A-

6
1

Branch path incidence matrix [K]

210

6[-o

-1
1

1l

o I o]
l;i

A
2

B=6

-1 0
C

11
10
0-l

From Fig. 1.34(b), basic cut-set matrix tB1

=[*]

0 0 0l

+l-r

K: s I -t

@oo
I 0 0l

00
-1
-l

ol
0l
0l

rl

0
I

-1

Fig. l.3a@)

t7
I

56 Hffiimltuu:q
Augmented cut-set matrix [B']

4
5

B'=

ABCD
1000
0100
0010
0001
0

J
7

l0-1
0-1-t

-l

EFG
000
000
000
000
100
010
001

=fX:

i-,ltl

From Fig. 1.34(c), basic loop incidence marr ix (c)

4
5

C-

I
3

EFG
-l-10

l_._\D
tin

-r0t
011
001
-i--- o --o
010
001

a
a

I
I

II

tlG

I
I
I

t;I

Fig. I.3a(c)

Augmented loop incidence matrix [C,]

ABCDEFG
2

4
5

C':6
I
J
7

0 o 0 | _r _1

0 1 0
0' 0 I
0 0 0

0l-1

0000
0 0 0

011

ll0

0 0 0 0l

=;*'

010
0i0

The matrices reananged for verification

It
or: I 0
l-r

-roor[o

o ol, [:L:
r,-lr
-r _;
;J

-1
0
0
0

-r
-1

0l
0l

0 rl
r0l

3:1

NetuorkMatrices 57

-r -r
t-r
-r o otlo
I
lll
0 -1
o
ollo
m &=A/Kr =
-l
o o
lo
L-l o -1 oilo o 1
fr

=lt

Lo

[-r

c,-BI -l-'
tt:

L:
-

lool

o -r

,l
ol

-l -l -ul=

-r

ol
0l

[n,1

0l
rl

, ,l= t'
0rl

A, Aa-'

-1
00
00
01

-l
A/x e;r = | 0 -t0
[-r 0-l

Io

or:

Ir

lo
Lo

Ir

J]

A:

oro.rl

-1 o o

0 0 o
ooro.]

rl

,l

-l-o l o rl
,ll_;
o
-,
;
;
;l
[-r
oll o o o 1l:l-' o I
oll o o r o-l Lo I I

ol

ol=-''
rl

1.16. For the power system shown in Fig. 1.35. Determine bus incidence matrix 'A',
incidence matrix 'K', basic cut-set maffix 'B' and basic loop incidence matrix 'C' and
drrlw that (i) lu Xr = U (ii) Bt : At t{. fate 1, 5, 4 as tee

lpth

Fig. r.35

(Aug.2fiI7)

58

ElecticalPower S4stemAnalysris

Sol. Selected tree of Fig.1.35 is shown in Fig. 1.36(a)

From Fig. 1.36(a). bus incidence matrix (A),

o0-1 @ o

I
I
I
I
I

-1 0
01-1
00-1
-1 00

A:5
2
3

zlt,

=[it]

,/;

l2

| .,'
@
Fig. r.36(a)

Branch path incidence matrix [K]

o @o
r[ r -, ,l

r:+l-l

,L

ol

r o ,l

From Fig. 1.36(b), basic cut-set matrix [B]

ABC
100
010
001
---:l
-i--- o

-l

B-

4
5

I
I

2l,,

,,

l,)

ci6

=[:l

Fig. 1.36(b)

-1

From Fig. 1.36(c), basic loop incidence matrix (c)

DE
rl -1 -1
ol 0-1
Ic, I
C:5 -1 -1 =Lr,]
l0
0l

r'I
zl

,l
I

q Y'l .....""

:l

(i)

A,KT:

I o -r0
i-l

[u
(,,)

0lI

-l

rl

ilIl

ol

,]

[r
o
tt

ol

Lo o

1l

=lo r

@
Fig. I.36(c)

ol:u

Bl=AlKr

Io
[-r

0
o

,r[

,lL-l

-l
0

l,

:]:[-r

-rl :
-,1

''

a^5

Power System Network Matrices 59

Problem 1.17. A 4 bus system is shown in Fig. 1.37.

(i)

(ii)

Find the bus incidence matrix

generators are 2 p-u.

'A'for

4 bus system. Take ground as reference. The reactance

of

Find also primitive admittance matrix for thip iystem, it is given that all the lines are characterized
by a seriis impednnce of (0.! + j\.i) ohm/fun and shuni admittance of j0.35 x t0'5 mhos/ton.

Fig. 1.37
(November 2004)

Sol. The oriented graph of Fig. 1.37 is shown in Fig. 1.38(a).

Frorn Fig. t.38(a), bus incidence matrix [A]

a
b
c

A-

d
e

f
o

10
00
l0
0-l
00
1
10

-1

-l

-l

-1

Given series impedance,

:
Zp:
Zs:
z

ground/ref

Fig. I.38(a)
(0.1 + j0.7) Q/km
(0.1 + j0.7) x 100

(10 + j70)0

(0.1 + j0.7)x 110: (ll + j77)A

Z1a: 15 + j105, Z"a: l0 + j70 and Ztq: 12 + j84
Similarly
y :7O.35 x 10-s U/km
And shunt admittance.
)12..: j0.35 x l0-5 x 100 : j0.35 x 10-3O, )13s :i0.3S5 x

)r4.

j0.525x 10-3U, yz*. :j0.35 x

Mutual admittances

!n: lzr:

1
i

- --- -i0'014
:0'002

10-3 O

andyro,

10-3 O

iO.42x l0-3(I.

50

Electicaltuurer

Analysis

)r:)r:
Similarly

)ia

)+r

+
Ltt
:

:0.00182

-jl.Olzl

0.0013 -j0.0093

!z+: J+z: 0.002 - j0.014

!as

!za.:

0.00166 -j0.01167

Diagonal admittances

Yrr

: )rz * )r: * -v,o"222r----+ * ** *+ :

0-00512 -j0.0354

: ):r * lzt * $*'?" : O.OO4 -j0.0276

,22
Yr::)sr *):+ * ,2
{l*+ 2 :0.00348-j0.023915

y:z

Y+r:0.00496- j0.03432

- 0.002 + .10.014 - 0.00182 + j0.0127

I o.oos 12 - i0.0354
0
vreus-l-0.00182+io.ot2l
_ I -0.002 + j0.014 0.004 * j0.0276

-0.0013 + j0.0093.
-0.002 + j0.014
0
0.00348-jo.0z3gr5 -0.00166 + j0.01167
j0.0093
-0.002 + j0.014 -0.00166+ j0.01167 0.00496 - j0.o3432,
[ -o.oorr +

slroRT
1. Whcn

does the need

QUESTTONS AND ANSWERS

for using a curved line

segment arise when drawing

a graph for

netrvork'J

Ans: For representing parallel connected network elements in a graph curved line

segments

required.

2.

Wltat are the directions assigned to the elements of an oriented graph of a power network?
Ans: The direction assigned to an element of the graph of a power network is taken to the known
assumed direction of current and voltage in the corresponding network element.

3.

What is primitive impedance matrix?

Ans: The elements of the primitive impedance matrix are the self and mutual impedance of indivi
network elements with their interconnection not considered
What is the dift'erence between an ordinary loop and a basic loop?
Ans: An ordinary loop is a closed path containing one or more links. A basic loop is a closed
having only one link

4.

5. Wlnt is a basic cut-set?

Ans: A basic cut-set is a set of minimum number of elements, removal of which divides the
' graph into two connected sub graphs and this set contains only one tree branch.
6. What does an incidence matrix'J
Ans: An incidence matrix represents, in general, interconnection of tlre elements, with respect to
nodes.

7. What is a bus'l
Ans: When one of the nodes of a power network is taken as the reference, then the other
called buses.

nodes

What are the rows of all the incidence matrices?

Ans: The rows of all the incidence matrices correspond to the elements.
g. why is tlie sub matrix U6 of basic cur-set matrix (B) is a unity matrix and what is its dimension?
cut- sets
Ans: Thi sub matrix U6 describes the incidence of branches to basic cut-sets. Since each basic
cut-sets
basic
of
The
number
matrix'
unity
is
a
U6
matrix
.ontuiri, only one branch, this sub
(b
x
b)
dimension
of
matrix
is
a
square
being'equal to the number of branches. Uu

8.

r0. what does the sub matrix c, of the incidence matrix c

represent?

Ans: The sub matrix C, describes the incidence of branches to basic loops.
ll. What are the elements of Y5u, represent?
and the off
Ans: The diagonal elements of Ysu. represent the short-circuit driving point admittances
diagonal elements, the short-circuit transfer admittances'
t2. How is a uetwork element represented in impedance form?
Are: By a voltage source in series with its self impedance'

is a primitive admiftance matrix?

matrix' the
Are: A primitive admittance matrix is a matrix which is an inverse of primitive impedance
network
the
of
impedances
self
the
diagonal elements of the primitive impedance matrix being
elements'
network
the
between
elements and the off-diagonal elements, the mutual impedances
be typeinature of the
14. If there is no mutual coupling between network elements, what will
13. What

primitive imPedance matrix?

.t\ It will be a diagonal

matrix.
of You. using an incidence matrix is called singular transformation?
determination
15. Why the
,lns: The incidence matrix which is used in the determination of an interconnected network matrix
network matrix is called a transformation matrix antl is singular. Hence, this

tiom a primitive
transformation is called a singular transformation'
16. How Y5u. is determined if some of the network elements are coupled?
Are: Y5,,, is determined by singular transtbrmation using Yhr. : At Dl e
17. How Zt.,,,p is determined if all the network elements are uncoupled?
Am: All tliagonal elements are determined as the sum of the impedances of elements in the basic loop'
negative of
corresponding to that diagonal element. An off-diagonal element is determined as the
to this
pertaining
loops
basic
the
to
common
the sum of the impedances of the network elements
off-diagonal element.
ft. If Znu. is required, how can it be determined using singular transformation?
Ans: Znu" is determined by singular transtbrmation using Zbr, = {Arb]A}-'

19. Detine directed graPtr?

Am: A graph is said to be directed or oriented graph when all the nodes and the branches are
numbered and directions are assigned to the branches by ariows.
20. Define a Notle?
Ans: Node is the meeting point of the two or more elements in a graph.
21. Define an element or edge ?
Ans: A edge is a line segment representing one network element or a combination of elements
comected between two nodes, in a graph.
22. What does a bus incidence matrix describe?
Ans: A bus incidence matrix describes the incidence i.e., the connection of arbitrary oriented elements
to the buses of the graph of a network.

62 ElectrbalPouser

Anatgsis

23. The entries in the bus admittance matrix are either +l of -l or 0. Is it a fact?
Ans: Yes
24. what cloes an entry of -l in fh row and /th column of matrix A denote ? .
Ans: It shows that the fh element is incident to the ts node and is directed towards it.
25. Write down the pertbrmance equation of an interconnected network in the bus frame of
Ans: Ior. =Yr,rrVr,r.
26. ln the transformation. used to obtain Ynu*, power variant
Ans: No
27. What is a Tree?
Ans: A tree is a sub graph containing all the nodes of the original graph but no closed paths or loops.
28. Define Twigs?
Ans: These are the braches of the trees.
29. What are the type for Construction of primitive network element ?
Ans: There are two types of representation:
1l) Impedance form (ii) Admittance form.
30. What is the Iimitation for direct inspection method?
Ans: The impedance and admittances can be found by direct inspection method provided mutual
between the elements of the given power system network is neglected.
what are the tbrmulae for determined you, from direct inspection method?

31.
Ans: Self admiffance, Yii = the sum of the admittances of
Mutual admittance, Y,7
32. what are the lormulae

Am: Self impedance . Zii

and Mutual impedance,

the elements that are creating the node at bus

Negative slgn of admittance berween the adjacent busses 'i' and 'jr.

.i'

for determined znq, from direct inspection method?

the sum of the impedances of the elements that are creating the node at bus

Z, :

Negative sign of impedance between the adjacent basic loops

'i'

and

OBJECTIVE TYPE QUESTIONS

A tree has
(a) a closed

path

(D) no closeil paths

The number of branches in a tree is

(c) botr

(d)

none

the number ofbranches in a graph.

(a) less than

(D) more than
(c) equal
(d) none
The tie set schedule gives the relation between
(a) branch currents and link currents
(D) branch voltage and link currents
(c) branch currenrs and link voltages
(@ none
4. TliJ cut set schedule gives the relation between
(a) branch currents and link currents
(D) branch voltages aod tree branch voltages
(c) branch voltages and link voltaggs
(d) brauch curent and EE crurents
5. If a network contains 'e' elements 'n' nodes, then the number of mesl crrrcil equations would
(a) e-(n-l)
(b') n{te-l\
(c) e-n-l
(i, e+*l

6.

A network has seven nodes and five independent loop, then the rrumbcr of

(a\

13

(b)

12

(c)

1l

rlanr:

(4 x)

in

be

tb netrrork is

7. In element nsde incidence matrix. the rank is

(a) less than nodes (b) greater than nodes (c) equal to
(d) none
3. In branch path incidence matrix, if the ie branch is in the path from the jth bus to reference but
is oriented in opposite direction then

(a)

t.
ll.

K,) =

(b\ -1

(c)

Among the following relations, which is correct

(a) K, - A, -t
(D) It : Ar,
(c) A't
The dimension of basic loop incidence matrix is

K, -'

(d)

none

(d)

none

(a) links by nodes (b) elements by links (c) links by branches (d) none
ll. The performance equation in impedance form is
(a) v * i = z\e
(b), t, s - 1xi
(c) both
(d) none
Lll. In the loop frame of reference, the perforrnance of an interconnected network is

described

by________

(a) n-l independent nodal equations

(c) 'b' independent branch equations
13.

Zbu* expression

(b) 'f independent loop equations

(d) none

in terms of branch path matrix

(D * zur.
(c) K zBRlK
of various components in a power system is called
(a) branches
(b) bus
(c) links

(a) K'YBRK

Itl.

(4

K'

ZBRK

The meeting

(d) none
15. If You, is symmetrical then the corresponding Zru" is
(a) unsymrnetrical (b) symmetrical
(c) neither (a) nor (b) (d) none
15. The off-diagonal elements in You" are called as
(c) self admittance (b) mutual admittance (c) symmetrical
(d) att
17. A set of unconnected elements is defined as a
network.
(a) primitive
(D) complete
(c) symmetrical
(d) att

It.

The-branch admittance matrix can be obtained by, using

(a) a closed path (b) no closed paths (c) both

(d)

none

ANSWERS

r.

(b)

7. (a\
13.

(d)

2. (a)
8. (D)
14.

(b\

4.

3.. (a)
9. (a\

rs.

(b)

10. (r)
16. (b)

(b)

5.

(a)

6.

(c)

11. (r)
17. (a)

12.

(c)

EXERCISE

1. Define the following matrices with one example for each matrix.
(a) Elements node incidence matrix
(b) Bus incidence matrix
(c) Basic cut:St incidence matrix
(d) Basic loop incidence matrix
(e) Branch path incidence matrix.

2. What are the elements of the following:

(a) Bus incidence matrix
(c) Basic cut-set incidence matrix

(b) Basic loop incidence matrix

(d) Branch path incidence matrix.

8.(A

il

Etecfficalfuwer fustemAnalgsls

3.

Bus incidence matrix is given below.

Draw the graph and tree.

ooo
0

r[-l

0l

^ zl rr -lo -llol
o:rl
+L o

-r

4.

@) A,,kr

5.
6.
7.

'j

Prove the following relations with one example.

: U

(D)

C'[B']r : U

(c)

Co

: tArl tYl IAI

Prove that Z,nu, : Cr tzl [C].

- - B,t

Prove thar Yu,.

Determine the Zsu. and Yuu. for the following network shown in

Fig. I .39 and the admittance

in p.u. value.

15

j7.5

Fig. 1.39
Determine Ysu. flnd Zrn., by direct inspection method for the following network shown in Fig.

is

i20

j2s

i15
i10

Fig. l.4O
Given values

urlin

p.u. of impedances.

j5

Power SgstemNehuorkMatnces

9. Determine all the incidence matrices for

following power system network shown

6t

in Fig. 1.41.

Fig. r.4l
r0. For the problem 9 the impedance values are given below. Determine Y6u, and Zsu, by singular
transformation method.
Element No.
1

Self impedance in p.u.

0.5
2.5

1.5

6
7

2.5
1.0

2.0

1.25