SVCE TIRUPATI

COURSE MATERIAL

SUBJECT POWER SYSTEM ANALYSIS (15A02603)

UNIT 1

COURSE B.TECH

ELECTRICL & ELECTRONICS

DEPARTMENT ENGINEERING

SEMESTER 31

PREPARED BY Dr. Y VENKATA KRISHNA REDDY

(Faculty Name/s) Associate Professor

Version V-1

PREPARED / REVISED DATE 03-05-2021

BTECH_EEE-SEM 31
SVCE TIRUPATI

TABLE OF CONTENTS – UNIT 5

S. NO CONTENTS PAGE NO.
1 COURSE OBJECTIVES 1
2 PREREQUISITES 1
3 SYLLABUS 1
4 COURSE OUTCOMES 1
5 CO - PO/PSO MAPPING 2
6 LESSON PLAN 2
7 ACTIVITY BASED LEARNING 2
8 LECTURE NOTES 4
1.1 Representation of Power System Elements 4
1.2 Graph Theory: Definitions, Bus Incidence Matrix 6
1.3 Ybus Formation by Direct and Singular Transformation Methods 16
1.4 Numerical Problems
1.5 Partial Network 17
1.6 Formation of Zbus: Addition of branch 18
1.7 Formation of Zbus: Addition of Link 19
1.8 Modification of ZBus for the Changes in Network 21
1.9 Numerical Problems
9 PRACTICE QUESTIONS 21
10 ASSIGNMENTS 23
11 PART A QUESTIONS & ANSWERS (2 MARKS QUESTIONS) 24
12 PART B QUESTIONS 25
13 SUPPORTIVE ONLINE CERTIFICATION COURSES 25
14 REAL TIME APPLICATIONS 26
15 CONTENTS BEYOND THE SYLLABUS 26
16 PRESCRIBED TEXT BOOKS & REFERENCE BOOKS 26
17 MINI PROJECT SUGGESTION 26

BTECH_EEE-SEM 31
SVCE TIRUPATI

1. Course Objectives
The objectives of the course are to make the students learn about:
1. Y bus and Z bus of a Power System network
2. Power flow studies by various methods.
3. Short circuit analysis of power systems.
4. Swing equation and its solution.
5. Equal area criterion and its applications
2. Prerequisites
Students should have knowledge on
1. Graph Theory
2. Engineering Mathematics
3. Power system generation, transmission
3. Syllabus
UNIT I
Representation of Power System Elements, Graph Theory: Definitions, Bus Incidence
Matrix, Ybus Formation by Direct and Singular Transformation Methods, Numerical
Problems. Formation of ZBus: Partial Network, Algorithm for the Modification of ZBus
Matrix for Addition Element for the Following Cases: Addition of Element from a New
Bus to Reference, Addition of Element from a New Bus to an Old Bus, Addition of
Element Between an Old Bus to Reference and Addition of Element Between Two
Old Busses (Derivations and Numerical Problems).- Modification of ZBus for the
Changes in Network ( Problems )
Course outcomes
At the end of the course the student should be able to:
1. Form the Zbus and Ybus of a given power system network
2. Compare different methods used for obtaining load flow solution
3. Conduct load flow studies on a given system
4. Make fault calculations for various types of faults
5. Determine the transient stability by equal area criterion
6. Determine steady state stability power limit
7. Distinguish between different types of buses used in load flow solution
4. Co-PO / PSO Mapping
Machine
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 P10 PO11 PO12 PSO1 PSO2
Tools
CO1 3 3 2 2

CO2 3 3 2 2

CO3 3 3 2 2

CO4 3 3 2 2

CO5 3 3 2 2

BTECH_EEE-SEM 31
SVCE TIRUPATI

5. Lesson Plan
Wee
Lecture No. Topics to be covered References
ks
1 Representation of Power System Elements T1

2 Graph Theory: Definitions, Bus Incidence Matrix T1, R1

1
3 Ybus Formation by Direct and Singular Transformation Methods T1, R1

4 Numerical Problems T1, R1

5 Numerical Problems T1, R2

6 Partial Network T1, R2

2
7 Formation of Zbus: Addition of branch T1, R2

8 Formation of Zbus: Addition of Link T1, R2

9
Modification of ZBus for the Changes in Network T1, R2

10 3 Numerical Problems T1, R2

11 Numerical Problems T1, R2

7. Activity Based Learning
1. Performance of power system can be analyses by load flow studies.
2. LFS provides idea about present and future power dispatch.
8. Lecture Notes

1.1 Representation of Power System Elements

The power system consists of three main parts, namely

(a) generation, (b) transmission, and (c) distribution. Generation involves the
synchronous machines along with the exciter, the governor, and the turbine. The
transmission system includes two main components: (i) the transformers, and
(ii) the transmission lines. The distribution system includes the distribution lines, the
transformers, and the different types of loads, namely constant impedance, constant
current, and constant power. For simulating/analyzing a power system, models
of all these components are required.

BTECH_EEE-SEM 31
SVCE TIRUPATI

BTECH_EEE-SEM 31
SVCE TIRUPATI

1.2: Graph Theory: Definitions, Bus Incidence Matrix

The purpose of network analysis is to find voltage across and currents through all
the elements. When the network is complicated and having a large number of
nodes and closed paths, network analysis can be done conveniently by using
‘Graph Theory’. The basic elements of this theory are branches, nodes, loops and
meshes.
 Node It is defined as a point at which two or more elements have a common
connection.
 Branch It is a line connecting a pair of nodes, the line representing a single
element.
 Loop Whenever there is more than one path between two nodes, there is a circuit
or loop.
 Mesh It is a loop which does not contain any other loops within it.

BTECH_EEE-SEM 31
SVCE TIRUPATI

GRAPH OF A NETWORK
 A linear graph is a collection of nodes and branches. The nodes are joined
together by branches.
 The graph of a network is drawn by first marking the nodes and then joining these
nodes by lines which correspond to the network elements of each branch.
 All the voltage and current sources are replaced by their internal impedances. The
voltage sources are replaced by short circuits as their internal impedances are
zero whereas current sources are replaced by open circuits as their internal
impedances are infinite.
 Nodes and branches are numbered. Figure 1.1 shows a network and its associated
graphs.
 Each branch of a graph may be given an orientation or a direction with the help
of an arrow head which represents the assigned reference direction for current.
Such a graph is then referred to as a directed or oriented graph.
 Branches whose ends fall on a node are said to be incident at that node.
Branches 2, 3 and 4 are incident at node 2 in Fig. 1.1(c).

Fig.1.1
DEFINITIONS ASSOCIATED WITH A GRAPH
(i) Planar graph A graph drawn on a two-dimensional plane is said to be planar if two
branches do not intersect or cross at a point which is other than a node. Figure 1.2
shows such graphs.

Fig.1.2 Planar graphs

(ii)Non-planar graph A graph drawn on a two-dimensional plane is said to be non-planar
if there is intersection of two or more branches at another point which is not a node.
Figure 1.3 shows non-planar graphs.

Fig. 1.3 Non-planar graphs

BTECH_EEE-SEM 31
SVCE TIRUPATI

(iii) Sub-graph It is a subset of branches and nodes of a graph. It is a proper sub-graph if

it contains branches and nodes less than those on a graph. A sub-graph can be just
a node or only one branch of the graph. Figure 1.4 shows a graph and its proper sub-
graph.

Fig. 1.4 (a) Graph (b) Proper Sub-graphs Fig. 1.5 Graph
(iv) Path It is an improper sub-graph having the following properties:
• At two of its nodes called terminal nodes, there is incident only one branch of sub-
graph.
• At all remaining nodes called internal nodes, there are incident two branches of a
graph.
In Fig. 1.5, branches 2, 5 and 6 together with all the four nodes, constitute a path.
(v) Connected graph A graph is said to be connected if there exists a path
between any pair of nodes. Otherwise, the graph is disconnected.
(vi) Rank of a graph If there are n nodes in a graph, the rank of the graph is (n – 1).
(vii) Loop or circuit A loop is a connected sub-graph of a connected graph at each
node of which are incident exactly two branches. If two terminals of a path are
made to coincide, it will result in a loop or circuit.

Loops: {1, 2, 3, 4} {1, 2}

Fig. 1.6
Loops of a graph have the following properties:
1. There are at least two branches in a loop.
2. There are exactly two paths between any pair of nodes in a circuit.
3. The maximum number of possible branches is equal to the number of nodes.
(viii) Tree A tree is a set of branches with every node connected to every other
node in such a way that removal of any branch destroys this property.
 Alternately, a tree is defined as a connected sub-graph of a connected graph
containing all the nodes of the graph but not containing any loops.
 Branches of a tree are called twigs. A tree contains (n – 1) twigs where n are the
number of nodes in the graph.

BTECH_EEE-SEM 31
SVCE TIRUPATI

Twigs: {1, 4, 5} {2, 3, 5}

Fig. 1.7
(ix) Co-tree Branches which are not on a tree are called links or chords. All links of a
tree together constitute the compliment of the corresponding tree and is called
the co-tree.
 A co-tree contains b – (n – 1) links where b is the number of branches of the
graph. In Fig. 1.7 (b) and (c) the links are {2, 3, 6} and {1, 4, 6} respectively.
 Trees have the following properties:
(i) There exists only one path between any pair of nodes in a tree.
(ii) A tree contains all nodes of the graph.
(iii) If n is the number of nodes of the graph, there are (n – 1) branches in the tree.
(iv) Trees do not contain any loops.
(v) Every connected graph has at least one tree.
(vi) The minimum terminal nodes in a tree are two.

INCIDENCE MATRIX
 A linear graph is made up of nodes and branches. When a graph is given, it is
possible to tell which branches are incident at which nodes and what are its
orientations relative to the nodes.

 The following incidence matrices are of interest in power network analysis.

(a) Element-node incidence matrix
(b) Bus incidence matrix
(c) Branch path incidence matrix
(d) Basic cut-set incidence matrix
(e) Basic loop incidence matrix


Element – Node Incidence Matrix ( A)


 The incidence matrix (A ) describes whether an element is incident to a particular
node (or) not. 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 towards from the jth node.

aij  0 If the ith element is not incident to the jth node.

BTECH_EEE-SEM 31
SVCE TIRUPATI

 The dimension of the matrix is e  n, where e is the number of elements and n is


the number of nodes in the graph. In (A ) matrix the entries 1 and –1 for a
particular element occur in pair and other entries for the element are zero.
 
Consequently, the sum of the elements in a row of (A ) , is zero. The rank of (A ) is
less than N, ie., (n - 1).

Bus – Incidence Matrix (A)

 Any node of a connected graph can be selected as the reference node. Then,
the variables of other nodes, referred to as buses, can be measured with respect

to the assigned reference. The matrix obtained from (A ) 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  (n  1) and the rank is (n  1)  b, where b is the number of branches in the
graph.
 The matrix is rectangular and therefore singular. If the rows of A are arranged
according to a particular tree, the matrix can be partitioned into sub matrices
A b of dimension b  (n  1) and A  of dimension   (n  1), where the rows of
A b correspond to branches and rows of A  to links. A b is a non singular square
matrix with rank (n  1).

BTECH_EEE-SEM 31
SVCE TIRUPATI

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 as follows:
kij  1 If the ith branch is in the path from the jth bus to reference and is
oriented in 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.

This is a non singular square matrix with rank (n  1).

 While the branch path incidence matrix relates branches to paths. the sub matrix
Ab of Fig. gives the connectivity between branches and buses. Thus. the paths
and buses can be related by A b K t  U where U is a unit matrix.
Hence K t  A b 1

Basic Cut Set Incidence Matrix (B)

 The incidence of elements to basic cut sets of a connected graph is shown by

the basic (or) fundamental cut set incidence matrix (B).
 The elements of this matrix are as follows:
b ij  1  If the ith element is incident to and oriented in the same direction as the
jth basic cut set.

b ij  1  If the ith element is incident to and oriented in the opposite direction as

the jth basic cut set.

b ij  0  If the ith element is not incident to the jth basic cut set.

B Ab  A  B  A Ab|
B  A KT Ab|  K T

BTECH_EEE-SEM 31
SVCE TIRUPATI

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 as follows:
c ij  1  If the ith element is incident to and oriented in the same direction as the
jth basic loop.

c ij  1  If the ith element is incident to and oriented in the opposite direction as

the jth basic loop.

c ij  0  If the ith element is not incident to the jth basic loop.

 The basic loop incidence matrix, of dimension e .

BTECH_EEE-SEM 31
SVCE TIRUPATI

Network Performance Equations

 A power system is a big complex network. Therefore, we require transforming the

primitive network matrices can be developed either in the bus frame, branch
frame or loop frame of reference. In these frame of references network matrices
can be written as,
 VBus  Z Bus IBus (or ) VBR  Z BR IBR (or ) VLoop  Z Loop ILoop
where VBus  Matrix contains bus voltages
IBus  Matrix represents the injected currents into the buses
Z Bus  Bus impedance matrix

 For an n–bus power system, the dimensions of these matrices are n  1, n  1 and
n  n respectively.
 The network equations in admittance form can be written as,
I Bus =YBus VBus where YBus =Z-|Bus

 The branch frame of reference performance equations can be written as,

I BR =YBR VBR where YBR =Z-|BR

 Finally, the loop frame of reference VLoop denotes the basic loop voltages,
ILoop represents the basic loop currents and Z Loop is the loop impedance matrix. In
the admittance form, the network equations can be written as,
I Loop =YLoop VLoop where YLoop =Z-|Loop

BTECH_EEE-SEM 31
SVCE TIRUPATI

 The size of the matrices in the network equation based on loop frame depends
on the number of basic links or loops in a graph of a given power system.

SingularTransformations

 The network matrices that are used commonly in power system analysis that can
be obtained by singular transformation are :

(i) Bus admittance matrix

(ii) Bus impedance matrix
(iii) Branch admittance matrix
(iv) Branch impedance matrix
(v) Loop impedance matrix
(vi) Loop admittance matrix

Bus Admittance Matrix and Bus Impedance Matrix

 The bus admittance matrix YBUS can be obtained by determining the relation
between the variables and parameters of the primitive network to bus quantities
of the network using bus incidence matrix.
i  j   y V

 Pre multiplying by [A t ] , the transpose of the bus incidence matrix

[A t ]i+[A t ]j=[A t ]  y  V ………………(1.1)

 Matrix A shows the connections of elements to buses. [A t ]i thus is a vector,

wherein, each element is the algebraic sum of the currents that terminate at any
of the buses. Following Kirchoff's current law, the algebraic sum of currents at
any node or bus must be zero. Hence [A t ]i = 0 …………….(1.2)
 Again [A t ]j term indicates the algebraic sum of source currents at each of the
buses and must equal the vector of impressed bus currents. Hence, IBus =
[A t ]j ………………..(1.3)
Substituting eqns. IBUS =[A t ] y  V ……………..(1.4)

 Power in the network = Power in the primitive network

 [I*BUS ]t VBUS =(j* ) t V …………………(1.5)
Conjugate transpose of eqn. (1.3) gives
[I*BUS ]t  (j* ) t [A] [A]*  [A]
……………………..(1.6)
Eqn (1.6) in (1.5) V  [A]VBUS ………………….(1.7)
Eqn (1.7) in (1.4)

BTECH_EEE-SEM 31
SVCE TIRUPATI

 IBUS   [A t ] y[A]VBUS  [YBUS ]VBUS

[YBUS ]  [A t ]  y [A]
1
[ZBUS ]  [YBUS ]1  [A t ]  y [A]
 
Bus Admittance Matrix and Bus Impedance Matrix
 In order to obtain the branch admittance matrix YBR' the basic cut-set incidence
matrix, is used. The variables and parameters of primitive network are related to
the variables and parameters of the branch admittance network.
 For the primitive network
i  j   y V
 Pre multiplying by [Bt ] , the transpose of the bus incidence matrix
[Bt ]i+[Bt ]j=[Bt ]  y  V ……………… (1.8)
 It is clear that the matrix [B] shows the incidence of elements to basic cut-sets.
t
Each element of the vector [B ]i is the algebraic sum of the currents through the
elements that are connected to a basic cut-set. Every cut-set divides the
t
network into two connected sub networks. Thus each element of the vector [B ]i
represents the algebraic sum of the currents entering a sub network which must
be zero by Kirchoff's law.
 Hence [Bt ]i = 0 …………….(1.9)
 [Bt ]j is a vector in which each element is the algebraic sum of the source
currents of the elements incident to the basic cut-set and represents the total
source current in parallel with a branch. Hence, IBR = [Bt ]j ………………..(1.9)
Substituting eqns. IBR =[Bt ] y  V ……………..(1.10)

 Power in the network = Power in the primitive network

 [I*BR ]t VBR =(j* ) t V …………………(1.11)
Conjugate transpose of eqn. (1.9) gives
[I*BR ]t  (j* )t [B] ……………………..(1.12) [B]*  [B]
Eqn (1.12) in (1.11) V  [B]VBR ………………….(1.13)
Eqn (1.13) in (1.10)

 IBR   [Bt ] y [B]VBR  [YBR ]VBR

[YBR ]  [Bt ] y [B]
1
[ZBR ]  [YBR ]1  [Bt ]  y [B]
 
Loop Impedance Matrix and Loop Admittance Matrix

 The loop impedance matrix is designated by [ZLooP]' the basic loop incidence
matrix [C] is used to obtain [ZLoop] in terms of the elements of the primitive
network.
 The performance equation of the primitive network is v  e  [Z]i …….(1.14)
 Premultiplying [C]t Eqn.(1.14)

BTECH_EEE-SEM 31
SVCE TIRUPATI

[C]t v  [C]t e  [C]t [Z]i

 As the matrix [C] shows the incidence of elements to basic loops, [C]t v yields the
algebraic sum of the voltages around each basic loop.
 By Kirchoff's voltage law, the algebraic sum of the voltages around a loop is
zero. Hence, [C]t v = 0. Also [C]t e gives the algebraic sum of source voltages
around each basic loop; so that, VLoop  [C]t e ………………(1.15)
 From power invariance condition for both the loop and primitive networks
[I*Loop ]t VLoop =(j* ) t e ………………(1.16)

 Substituting (1.15) in (1.16) [I*Loop ]t [C]t e=(j* ) t e ……………..(1.17)

 Therefore, i  [C* ]t ILoop …………….(1.18) [C]*  [C]

 i  [C]ILoop ………………(1.19)
 From Eqns. (1.15), (1.17) and (1.19),
VLoop  [C]t [z][C]I Loop  [ZLoop ]I Loop

[YLoop ]  [ZLoop ]1  {[C]t [z][C]}1

1.3 Bus Admittance Matrix by Direct Inspection

 Bus admittance matrix can be obtained for any network, if there are no mutual
impedances between elements, by direct inspection of the network. This is
explained by taking an example.

 The equivalent circuit is shown in Fig. below. The generator is represented by a

voltage source in series with the impedance. The three transmission lines are
replaced by their "pi equivalents".

BTECH_EEE-SEM 31
SVCE TIRUPATI

 The three nodes are at voltage VI' V2 and V3 respectively above the ground.
The Kirchoff’s nodal current equations are written as follows:

1.4 PERFORMANCE EQUATION OF PARTIAL NETWORK:

 Assume that impedance matrix ZBUS is known for a partial network of m buses and
a referance bus zero.
Ebus  Zbus *Ibus

BTECH_EEE-SEM 31
SVCE TIRUPATI

Ebus= (m*1) vector of bus voltages

Zbus= (m*m)
Ibus= (m*1) vector of bus currents
When an element p=q is added to the parial network it may be branch or
link.
If p-q is a brnch,
Ebus= ((m+1)*1) vector of bus voltages
Zbus= (m+1)*(m+1)
Ibus= ((m+1)*1) vector of bus currents
To determine the new Zbus requires calculation of elements in the row and
coloumn.
If p-q is a link, the dimensions of the matrices unchanged, but all the elements
of impedance matrix must be recalculated.

ADDITION OF BRANCH:
 The performance equation for the partial network with an added p-q is,

 Assumed that network consist of bilateral passive elements Zqi=Ziq where i=1,2,3,
……m.
Zqi determined by injecting a current at the ith bus and calculating the voltage at the qth
bus with respect to reference node. Since all the bus currents are zero. Now,
E bus  Zbus * Ibus
E1  Z1i Ii
E 2  Z2i Ii
..
E p  Zpi Ii
..
E m  Zmi Ii
E q  Zqi Ii let Ii  1p.u.  Zqi  E q

Vpq  Ep  Eq  Eq  Ep  Vpq
The currents in the elements are expressed
interms of admittance form:
i pq   ypqpq ypqp   Vpq 
   
i p   yppq ypp   Vp 

BTECH_EEE-SEM 31
SVCE TIRUPATI

 Subscript pq refer added element, p refers all other elements.

Here i pq  0 
i pq  y pqpq Vpq  ypqp Vp
y pqp Vp ypqp (E p  E  )
0  y pqpq Vpq  ypqp Vp  Vpq   
y pqpq ypqpq
Ep E
ypqp (  )
ypqp (E p  E  ) Eq Ep Ii Ii
Now Eq  E p    
ypqpq Ii Ii ypqpq
ypqp (Zpi  Zi )
Finally Zqi  Zpi 
ypqpq
 Zqq can be calculated by injecting a current source at qth bus.
E1  Z1q Iq
E 2  Z2q Iq
..
E p  Zpq Iq
..
E m  Zmq Iq
E q  Zqq Iq let Iq  1p.u.  Zqq  E q
Vpq  E p  E q  E q  E p  Vpq
Here i pq   
i pq  ypqpq Vpq  y pqp Vp
y pqp Vp y pqp (E p  E  )
1  y pqpq Vpq  y pqp Vp  Vpq  1   1 
ypqpq ypqpq
Ep E
1  y pqp (  )
1  y pqp (E p  E  ) Eq Ep Iq Iq
Now Eq  E p    
y pqpq Iq Iq y pqpq
1  y pqp (Zpq  Zq )
Finally Zqq  Zpq 
y pqpq
 If there is no mutual coupling, between added element and other elements of
partial network: ypqp  0
Zqi  Zpi
Zqq  Zpq  z pqpq
 If P is reference bus:
Zqi  0
Zqq  z pqpq
ADDITION OF LINK:

 If added element p-q is a link, the procedure for recalculating the elements of
the bus impedance matrix is to connect in series with the added element a
voltage source el as shown in figure. This creates a fictitious node ‘l’ which will be
eliminated later. The el is scaled that the current through the added link is zero.

BTECH_EEE-SEM 31
SVCE TIRUPATI

 E bus   Zbus Zil   Ibus 

   , el  El  Eq
el   Zli Zll   Il 
 Zli determined by injecting a current source at the ith bus and calculating voltage
at lth node with respect to bus q.
E1  Z1i Ii
E 2  Z2i Iq
..
E p  Zpq Ii
..
E m  Zmi Ii
el  Zli Ii let Ii  1p.u.  Zli  el
The series voltage source is
el  E p  E q  Vpl
Here i pl  0 
i pl  y plpl Vpl  y plp Vp
y plp Vp y plp Vp (E p  E  )
0  y plpl Vpl  y plp Vp  Vpl   
y plpl y plpl
y plp Vp (E p  E  )
Now el  E p  E q 
y plpl
Ep E
y plp Vp (  )
el Ep Eq Ii Ii
  
Ii Ii Ii y plpl
y plp Vp (Zpi  Zi )
Finally Zli  Zpi  Zqi 
y plpl
 Zll calculated by injecting a current at l th bus with q as reference and calculating
the voltage at the lth bus respect to bus q.
Here i pl  il  1 
i pl  y plpl Vpl  y plp Vp
1  y plp Vp 1  y plp Vp (E p  E  )
1  y plpl Vpl  y plp Vp  Vpl   
y plpl y plpl
Ep E
1  y plp Vp (  )
1  y plp Vp (E p  E  ) el Ep Eq Il Il
Now el  E p  E q     
y plpl Il Il Il y plpl
y plp Vp (Zpl  Zl )
Finally Zll  Zpl  Zql 
y plpl

 If there is no mutual coupling, between added element and other elements of

partial network: ypqp  0
Zli  Zpi  Zqi
Zll  Zpl  Zql  z plpl
 If P is reference bus:
Zli   Zqi
Zll   Zql  z plpl

BTECH_EEE-SEM 31
SVCE TIRUPATI

 The imaginary node l is eliminated by short circuiting the series voltage source el
E bus  Zbus * I bus  Zil * Il
Zli * I bus
el  Zli * I bus  Zll * Il  0  Zli * I bus  Zll * Il  Il  
Zll
Zli * Ibus
Finally, E bus  Zbus * I bus  Zil *(  )
Zll
E bus Z *Z Z *Z
 Zbus  il li   Zbus new   Zbus old  il li
Ibus Zll Zll

Practice Quiz

01. Normally YBUS matrix is a

(a) Null matrix (b) Sparse matrix (c) Full matrix (d) Unity matrix

ANSWER: B

02. Normally ZBUS matrix is a

(a) Null matrix (b) Sparse matrix (c) Full matrix (d) Unity matrix

ANSWER: C

03. Which of the following is false?

(a) An element of a graph is called an edge.
(b) Each line segment is called an element.
(c) Each current source is replaced by a short circuit in a graph.
(d) Each voltage source is replaced by a short circuit in a graph.

ANSWER: C

04. The rank of a graph is……….., where n is the number of nodes in the graph.
(a) n (b) n-1 (c) n+1 (d) 1

ANSWER: B

05. In a graph if there are 4 nodes and 7 elements the number of links is
(a) 3 (b) 4 (c) 5 (d) 11
ANSWER: B

06. The dimension of the bus incidence matrix is

(a) e x n (b) e x (n- 1) (c) e x e (d) e x n
ANSWER: B

07. Identify the current relations

(a) [A]t [y] [A] = YLoop (b) [B]t[y] [B] = ZBR (c) [C]t[z] [C] = ZLoop (d) [C]t[z] [C] = ZBR

ANSWER: C

BTECH_EEE-SEM 31
SVCE TIRUPATI

08. Identify the correct relation

(a) YBUS = [B]t[y] [B] (b) YLoop = [C]t[y] [C] (c) YBR = [B]t[y] [B] (d) [C]t[z] [C] = ZBR
ANSWER: C

09. By eliminating reference node in element-node incidence matrix, then the so

formed matrix is
(a)Bus Incidence Matrix (b) Basic Loop (c) Branch Path (d) Basic Cut-Set
ANSWER: A

10. Co-tree branches are called

(a)twigs (b) links (c) cut-set (d) tie-set
ANSWER: B

11. Which of the following statements is true?

(a) There is a one-to-one correspondence between links and basic cut sets.
(b) A*(inverse Ab) = B where B is the basic cut set incidence matrix.
(c) BI = A(transpose k) where BI is the basic cut set incidence matrix containing links only.
(d) None
ANSWER: C

12. Which of the following statements is true?

(a) n basic cutsets are linearly independent where n is the number of nodes.
(b) The cut set is a minimal set of branches of the graph.
(c) The removal of k branches does not reduce the rank of a graph provided that no
proper subset of this set reduces the rank of the graph by one when it is removed
from the graph.
(d) all
ANSWER: B

13. The purpose of Ybus calculation in power system is used for load flow study
(a) True
(b) False
ANSWER: A

14. The purpose of Zbus calculation in power system is not used for fault analysis
(a) True
(b) False
ANSWER: B

15. Set elements that, if removed, divides a connected graph into two sub-graphs
known as
(a) Tie set
(b) Cut set
(c) Tree
(d) Co-tree
ANSWER: B

BTECH_EEE-SEM 31
SVCE TIRUPATI

16. The dimension of the basic cutset incidence matrix is,

(a) e x n
(b) e x (n- 1)
(c) e x e
(d) e x n
ANSWER: B

17. The dimension of the augmented loop incidence matrix is,

(a) e x n
(b) e x (n- 1)
(c) e x e
(d) e x n

ANSWER: C

18. Due to addition of branch to the partial network the Zbus size is
(a) Remains same
(b) Increase by one
(c) Decrease by one
(d) Temporarily increases and later recalculate Z bus matrix.
ANSWER: B

19. Due to the addition of shunt capacitors to the power system network the Ybus
diagonal element magnitude
(a) Remains same
(b) Increase
(c) Decrease
(d) Does not effect
ANSWER: C

20. Due to addition of link to the partial network the Zbus size is
(a) Remains same
(b) Increase by one
(c) Decrease by one
(d) Temporarily increases and later recalculate Z bus matrix.
ANSWER: D

10. Assignments

S.No Question BL CO

Derive the formula for Zbus using building algorithm if the

1 element is a branch with mutual coupled to other element. 3 5

Describe the procedure for modifications of Zbus when a link

2 with mutual impedance is added. 5 5

BTECH_EEE-SEM 31
SVCE TIRUPATI

With the use of Graph Theory concepts, explain the

following matrices:
3 5 5
(a) Element node incidence matrix Â.
(b) Bus incidence matrix A.

Define the following and explain with suitable examples.

4 5 5
(i) Oriented graph. (ii) Tree. (iii) Link. (iv) Loop. (v) Cut set.

5 5 5

Determine ZBUS for the network shown in figure below where all
impedance.
Determine YBUS for the network shown in figure above where all
6 impedance, by using direct method and singular transformation 5 5
method.

11. Part A- Question & Answers

S.No Question & Answers BL CO

1 Define Cut set and Tie set.
The minimal removal branches which divides the graph into two
subparts known as cut-set. The number of cutsets equal to no.of
twigs. 1 3
Select one tree, add one link to that tree then framed one closed
loop. It’s called fundamental loop or tie-set. The number no.of tie-
sets equal to number of links.
2 Define node and branch.
The intersections of two or more branches are called as node. The
1 3
element between two pair of nodes is called as branch. The nodes
and branches important for graph theory.
3 What is the difference between bus admittance matrix and bus
impedance matrix?
Admittance bus used for load flow studies. Ybus also called as sparse
matrix or zero matrix. Ybus can be calculated directly by taking entire
1 3
network at a time.
Impedance bus used for fault and stability analysis. Zbus also called as full
matrix. Zbus calculated by step by step method by taking one single
element at a time.

BTECH_EEE-SEM 31
SVCE TIRUPATI

4 Write the equation for the bus admittance matrix.

 IBUS   [A ] y[A]VBUS  [YBUS ]VBUS
t

[YBUS ]  [A t ]  y [A] 1 3
1
[ZBUS ]  [YBUS ]1  [A t ]  y [A]
 
5 Define primitive network.
The power system can be represented in primitive network form.
1. Impedance form v  e  [Z]i 1 3
i  j   y V
2. Admittance form

12. Part B- Questions

S.No Question BL CO
1 Derive the formula for Zbus using building algorithm if the 1 5
element is a branch with mutual coupled to other element.

2 Describe the procedure for modifications of Zbus when a link 4 5

with mutual impedance is added.

3 With the use of Graph Theory concepts, explain the 4 5

following matrices:

(c) Element node incidence matrix Â.

(d) Bus incidence matrix A.

4 Define the following and explain with suitable examples. 5 5

(i) Oriented graph. (ii) Tree. (iii) Link. (iv) Loop. (v) Cut set.
5 5 5

Determine ZBUS for the network shown in figure below where all
impedance.

13. Supportive Online Certification Courses

1. POWER SYSTEM ANALYSIS NPTEL COURSE BY IIT Kanpur – 12 weeks

BTECH_EEE-SEM 31
SVCE TIRUPATI

14. Real Time Applications

S.No Application CO
1 Graph theory used for analysis of large complex system. 3
2 Incidence matrices provide the information about loop currents, nodal 3
voltages and power flows.
3 Y bus used for load flow study and Z bus used for fault and stability 5
analysis

15. Contents Beyond the Syllabus

1. Formation of Y bus and Z bus using Matlab program.
2. Z bus formation by removing one element.

16. Prescribed Text Books & Reference Books

Text Books:
1. Power Systems Analysis, Grainger and Stevenson, Tata Mc Graw-hill, 2005.

2. Modern Power system Analysis 2nd edition, I.J.Nagrath & D.P.Kothari: Tata
McGraw- Hill Publishing Company, 2003.

REFERENCE BOOKS:

1. Computer Techniques in Power System Analysis 2nd Edition,, M A Pai, TMH,

2005.
2. Computer Techniques and Models in Power Systems, K. Uma Rao, I. K.
International, 2007.
3. Electric Power Systems 1st Edition, S. A. Nasar, Schaum‟ s Outline Series, TMH,
1997.
4. Computer Methods in Power System Analysis, E. I. Stagg and El-Abiad, Tata Mc
Graw Hill, 1969.

Mini Project Suggestion

1. Implementation of Y bus and Z bus using MATLAB
By calculating the Y bus load flow study can be obtained, Z bus calculation used
for fault and stability analysis.

BTECH_EEE-SEM 31