Professional Documents
Culture Documents
Aph Theory PDF
Aph Theory PDF
GRAPH THEORY
1.1 INTRODUCTION
An electrical circuit or network is an interconnection of electrical elements
such as resistors, inductors, capacitors, transmission lines, voltage sources, current sources,
and switches. The analysis of electrical circuit should results in knowing the voltage across
and currents through all the circuit elements. In circuit analysis, all the elements in a network
must satisfy Kirchhoffs laws, besides their own characteristics. Network topology is a
generic name that refers to all properties arising from the structure or geometry of a network.
If each element or a branch of a network is represented on a diagram by a line irrespective of
the characteristics of the elements, we get a graph. Hence network topology is network
geometry. Thus topology deals with the way in which the various elements are interconnected
at their terminals without considering the properties and type of the elements connected. This
method is considered to be a more systematic approach to the analysis of large electrical
networks.
For small circuit analysis based on nodal and mesh equation methods by using
Kirchoffs law and Ohms law are sufficient. But for complex networks these methods are
difficult and take more time for solving the equations. The high speed digital computers has
made it possible to use graph theory advantageously for larger network analysis. In order to
describe the geometrical structure of the network, it is sufficient to replace the different
power system components such as generators, transformers and transmission lines etc. by a
single line element irrespective of the characteristics of the power system components. These
line segments are called elements and their terminals are called nodes.
1.2 BASIC DEFINITIONS
Node: A node is a junction point or inter-connection point of two or more network elements.
Element or Branch or Edge: An element is a line segment representing one network
element or a combination of network elements connected between two nodes.
Degree of a node: It is the number of branches incident on a node.
Graph: In a network, if the branches are represented by straight line segments and nodes by
dots, then the resultant diagrammatic representation is called as a graph.
Oriented Graph: If each line segment of a graph is assigned with a direction, it is called as a
oriented graph.
Connected Graph: When there exits at least one path between every pair of nodes, then the
graph is called as a connected graph.
1
Tree: The tree of a network connects all the nodes of the network but contains no closed
path.
Twig: Each branch of a tree is called as a twig.
Co-tree: All branches that are present in the network, but not in the tree of the network,
together constitute a Co-tree.
Link: Each branch of a co tree is called as a link or chord.
Path: A path is a traversal from one node to another node of a graph along the branches,
such that no node is encountered twice.
Planar graph: If a graph contains no cross-overs i.e. if it can be represented on a single
plane, then it is called as a planar graph.
Sub-graph: A graph Gs is said to be the sub graph of a graph G, if every node of G s is a
node of G and every branch of Gs is also a branch of G.
Rank: The rank of a connected graph is defined as (n-1)
Where n = no. of nodes in the graph
Tie-set: Tie-set is a set of branches which forms a closed path or loop.
A basic tie-set or a fundamental tie-set is a tie-set having one and only one link branch, the
other elements being tree branches
Cut-set: A fundamental cut-set of a graph w.r.t a tree is a cut-set formed by one and only
one twig and a set of links, which must be cut to divide the network graph into two parts.
The conventional direction for the fundamental cut-set is taken to be the same as the direction
of the tree branch defines the particular cut-set.
Example: The following fig 1.1 shows all the above things clearly
Fig.(1.1)
2
Fig.(1.2)
Note: Since energy sources are replaced by their internal impedance, voltage and
current sources are replaced by short circuit and open circuit respectively.
1.3.1 Properties of a Tree
The tree of a graph has the following properties:
i) It is a connected sub-graph.
ii) It contains all the nodes of the original graph.
iii) A graph having n nodes will have (n-1) branches in its tree.
iv) Tree does not contain any closed path.
v) There may be many trees for a given graph.
):
This matrix shows which branch is incident to which node. Each column of
the matrix represents the corresponding node of the graph; each row represents the
corresponding element. If there are n nodes and e elements in a graph, then the order of
the element node incidence matrix is n e
The elements aij of the complete incidence matrix [A1] are found as follows
aij = 1, if ith element is incident and oriented away from the jth node.
aij = -1, if ith element is incident and oriented towards the jth node.
aij = 0, if ith element is not incident to the jth node.
Consider the graph as shown in fig.(1.3). The element node incidence matrix is given by
reference node is the bus incidence matrix A. The order of the matrix is ex (n-1) and the rank
is (n-1).
The matrix A can be partitioned into two sub-matrices (i) At of dimension (n-1)x(n-1)
corresponding to the branches which are twigs and (ii) A l of dimension lx(n-1) corresponding
to links. The partitioned matrices are shown below
Since A gives the incidence of various branches on the node with their direction of incidence,
the KCL equation for the nodes can be written as
AT i = 0
--- (1.1)
The branch path incidence matrix and the sub matrix A t relate the branches to paths and
branches to buses respectively. So there is one to one correspondence between paths and
buses.
5
At KT=U
KT= At-1
--- (1.2)
The sub matrix Bl can be obtained from the bus impedance matrix A. The incidence of links
to buses is given by the sub matrix Al and the incidence of elements to buses is given by the
sub matrix Ab. Since there is a one to one correspondence of the elements and basic cut-sets,
Bl Ab gives the incidence of links to buses.
i.e
Bl At= Al
Bl = Al At-1
= Al KT
--- (1.3)
does not divide the graph into two separate parts). We get a non-singular square matrix of
dimension ee. The augmented cutset matrix for the example of fig.(1.5) is
--- (1.4)
Example -1
For the oriented graph as shown in figure, obtain the bus incidence matrix A, branch path
incidence matrix K and basic cut set matrix B.
[ JNTU, supplementary , Nov- 05]
Solution:
Number of nodes, n=5
Example -2
Determine the incidences matrices A, K, B, B1, C, C1 for the figure as shown below
and verify the following
i) Cb = -BTl
ii) C1 (B1) T = U
iii) At KT = U
Solution:
The oriented graph for the given network is
iv) Bl = Al KT
10
Verification:i) Cb = -BTl
11
Ab
Al
--- (1.5)
The following properties are now stated without a rigorous proof and illustrated for some
examples.
Property 1: For a given tree of a graph each row of the fundamental loop matrix C is
orthogonal to each row of the fundamental cut set matrix B. Mathematically this relationship
implies
BT C = C BT = 0
Since B =
U
,
Bl
Cb
U
, it follows
Cb
U
=0
and C =
[ U/ BTl]
[CbU+BlTU]=0
Since U 0
--- (1.6)
[Cb+BlT]U=0
Cb+BlT = 0
[BTl] [ Cb] = 0
CbT = - Bl
Cb = - BTl
--- (1.7)
12
This is a very important result. It tells us that for a given tree of a graph, if the fundamental
loop matrix C is known, the fundamental cut set matrix is also known and vice-versa. This
relationship can be verified from eq. (1.7)
Property 2: Let the incidence matrix A can be arranged in the order of tree branches and
links for a given tree i.e
Ab
Al
--- (1.8)
It can be shown that Ab is non-singular. Furthermore, the fundamental cut set matrix for a
given tree is given by
B = A Ab-1
=
Since
We have
B=
Ab
Al
Ab-1
U
Al Ab
--- (1.9)
U
Bl
--- (1.10)
Bl = [ Al A-1 b]
--- (1.11)
This important result tells us that, by choosing a tree and writing the incidence matrix by
inspection we can obtain the fundamental cut set matrix B and also the fundamental loop
matrix C from property 1.
Example-3: For the network graph as shown in figure, choose a tree whose branches are
(1,2,3). Find the fundamental cut set and loop matrices B and C by using the bus incidence
matrix.
Solution:
13
Therefore Ab =
0 ,
1 0
Ab
1
1
0 0
1 0
Al Ab
0 1
0 1
1 0
1 0
Adj Ab
Ab
0 1
Al =
0
1
0
Adj Ab =
Ab
0 1
0 1
Bl = Al Ab-1 =
1(1 0) 1
0
1
0 -1
0
0
0 -1 -1
1
0 -1 0
1
0 -1 -1
0
1 0 0
1
0
14
1
0
Ub
Bl
0
0
1
0
0
1
1
0
1
1
1
1
1
0
1 0
= 1 1
1 1
1 0
1
Cb
C=
= 1
U
1
0
1
1
0
1
Vxy = ex - ey
Vxy Zxy ixy + exy = 0
15
--- (1.12)
--- (1.13)
--- (1.14)
--- (1.15)
16
--- (1.16)
--- (1.17)
--- (1.18)
--- (1.19)
network matrices into more meaningful matrices which can relate variables of the
interconnected network.
1.8.1 Bus admittances and impedance matrices
The bus admittance matrix Ybus and bus impedance matrix Z bus can be determined by
using bus incidence matrix A which relates the variables and parameters of the primitive
network to the bus quantities.
The performance equation of the primitive network in admittance form is given by
i+j = [y]V
pre multiplying both sides with AT, we obtain
AT i + AT j = AT [y] V
--- (1.20)
According to KCL, the algebraic sum of currents meeting at any node is equal to zero.
i.e AT i = 0
--- (1.21)
similarly algebraic sum of AT j gives the algebraic sum of all source currents incident at each
bus and this is nothing but the total current injected at the bus. Hence
AT j = IBUS
--- (1.22)
--- (1.23)
Power into the network is [IBUS*]T VBUS and the sum of powers in the primitive network is
[j*]T V. the power in the primitive and interconnected networks must be equal, i.e the
transformation of the variables must power invariant.
[IBUS*]T VBUS = [j*]T V
--- (1.24)
--- (1.25)
--- (1.26)
--- (1.27)
--- (1.28)
--- (1.29)
18
--- (1.30)
--- (1.31)
--- (1.32)
BT i is the algebraic sum of the currents through the elements inside the basic cut set and this
is zero.
BT i = 0
--- (1.33)
Similarly, B j is a vector in which each element is the algebraic sum of the source currents of
the elements to the basic cut set and can be treated as a single current source in parallel with
the unique tree-branch in the basic cut set. It is denoted by I BR and given by
BT j = IBR
--- (1.34)
--- (1.35)
Power into the network is given by [I BR*]T VBR, and this is equal to the sum of powers in the
primitive network, [j*]T V since the power is invariant
[IBR*]T VBR = [j*]T V
--- (1.36)
--- (1.37)
--- (1.38)
--- (1.39)
--- (1.40)
--- (1.41)
--- (1.42)
--- (1.43)
--- (1.44)
CT V is the algebraic sum of the all branch voltages in the loop and is equal to zero.
CT V = 0
--- (1.45)
Similarly C e gives the algebraic sum of the source voltage around each basic loop.
VLOOP = CT e
--- (1.46)
--- (1.47)
Power into the network is given by [I LOOP*]T VLOOP, and this is equal to the sum of powers in
the primitive network, [i*]T e since the power is invariant
[ILOOP*]T VLOOP = [i*]T e
--- (1.48)
--- (1.49)
[i*]T = [C ILOOP*]T
i* = C ILOOP*
i = C* ILOOP
--- (1.50)
--- (1.51)
--- (1.52)
20
--- (1.53)
--- (1.54)
--- (1.55)
Example 4: Derive an expression for ZLOOP for the orient graph as shown below
[JNTU regular Nov-2005]
Solution:
No. of nodes, n = 5
No. of tree branches, b = n-1 = 5-1 = 4
No. of links, l = e-b = 7-4 = 3
For the graph shown, let us assume 1,2,3,7 are tree branches. So the tree and corresponding
basic loop incident matrix for the given graph as
Let us assume the primitive impedance matrix for the given system is
Z 11
Z 12
Z 13
Z 14
Z 15
Z 16
Z 17
Z 21
Z 31
z = Z 41
Z 51
Z 61
Z 71
Z 22
Z 32
Z 42
Z 52
Z 62
Z 72
Z 23
Z 33
Z 43
Z 53
Z 63
Z 73
Z 24
Z 34
Z 44
Z 54
Z 64
Z 74
Z 25
Z 35
Z 45
Z 55
Z 65
Z 75
Z 26
Z 36
Z 46
Z 56
Z 66
Z 76
Z 27
Z 37
Z 47
Z 57
Z 67
Z 77
21
Note:- if there is no mutual coupling between the elements, [Z] is a diagonal matrix, whose
elements are impedances of the branches. If mutual coupling exists, then the corresponding
off-diagonal elements of [Z] will have a non-zero entry.
Let the mutual coupling between the elements is zero
Z 11
0
0
0
0
0
0
[z] =
Z 22 0
0
0
0
0
0 Z 33 0
0
0
0
0
0 Z 44 0
0
0
0
0
0 Z 55 0
0
0
0
0
0 Z 66 0
0
0
0
0
0 Z 77
Zloop = CT [z] C
Z 11
1 1 0 0
0 0 1 0
1 0 0 0 1
Z 22
Z 11
Z 22
Z 11
0
0
0
0
0
0
0 1
Z 22 0
0
0
0
0
0 Z 33 0
0
0
0
0
0 Z 44 0
0
0
0
0
0 Z 55 0
0
0
0
0
0 Z 66 0
0
0
0
0
0 Z 77
1 1
Z 33 Z 44
Z 22
1 0
Z 55
1 0
Z 66
Z 77
0 1
0 0
Z 22
Z 22
0 0
1
1
Z 22
Z 22
Z 11
Z 11
0 1
1 1
Z 22
Z 44
1 0
0 1
Z 33
0 0
0 0
Z 22
1 0
Z 55
Z 22
Z 22
Z 11
Z 22
Z 11
Z 66
Z 77
Example 5: For the system as shown in figure, construct Y BUS by singular transformation
method. The parameters of various elements are given in table. Take node 1 as reference
node.
22
Element
Reactance in p.u
1-2 (1)
0.04
1-6 (2)
0.02
2-4 (3)
0.0.
2-3 (4)
0.02
3-4 (5)
0.08
4-5 (6)
0.06
5-6 (7)
0.05
Solution: The oriented graph and tree for the given system can be drawn as shown below.
No. of elements, e = 7
No. of nodes, n = 6
No. of tree branches, b = n-1 = 6-1 = 5
No. of links, l = e-b = 7-5 = 2
Let us assume the node 1 as reference node. The bus incidence matrix for the given system is
23
j 0.02
j 0.03
j 0.02
j 0.08
j 0.06
j 0.05
[Z] =
[y] A =
j 20
j 25
j50
j33.3
j50
j12.5
j16.67
0
j 25
j 50
j 33.3
j 33.3
j 50
j 50
j12.5
j12.5
j16.67
j16.67
j 20
0
j 20
1
0
1
0
1
1
1
0
1
0
0
0
0
0
1
1 1 0
0
1 1
0
0
0
0
0
1
0
0
0
0
0
0
j 50
j 33.3
j 50
j 33.3
j 33.3
1 1
0
1
j108.33
YBUS
j 25
j 50
j 50
j12.5
j12.5
j16.67
j16.67
j 20
j 20
j 50
j 33.3
j 62.5
j12.5
j12.5
j 62.5
0
j 36.67
0
0
j16.67
0
j 36.67
j 20
j 20
j 70
0
0
0
0
b) N-1
N1
c) N -1
d) N +1
2. The number of independent loops for a network with N nodes and B branches is B - N + 1
a) B+ N + 1
b) B+ N-1
c) BN-1
d) B- N+1
3. The graph of an electrical network has N nodes, B branches. The number of links L with
respect to the choice of tree is given by B - N + 1
a) B+ N - 1
b) B+ N-1
c) BN+1
d) B- N+1
c) both
d) none
c) both
Mutual admittance
d) none
6. The matrix consisting of the self and mutual admittances of the network 1of the power
system is called Bus admittance matrix
a) loop admittance b) node admittance c) Bus admittance
7. If a graph having N number of nodes, the rank of the graph is
a) N + 1
b) N-1
c) N2-1
b) node
c)both
d)none
n-1
d) N2+1
vertex
d)none
b) 4
c) 7
d) 3
25
b) e n
ex (n-1)
c) (e-1) (n-1)
d) (e-1) n
b) no closed path
b) greater than
c) qual to
d) none
13. If a network contains B branches and N nodes, then the number of mesh current equations
would be b-(n-1)
a) B+ N + 1
b) B+ N-1
c) BN-1
d) B- N+1
b) bus
c) both
d) none
b) unsymmetrical
c) both
symmetrical
d) none
16. Tree is a sub-graph containing all the _____ of the original graph vertices
a) vertices
b) elements
c) both
d) none
b) branch
c) link
d)all
18. The incidence of element to nodes in a connected graph is given by ------ incidence
matrix
a) bus
element node
b) element node c) loop
d)all
19. The number of loops in a connected graph is equal to the number of links
a) vertices
b) elements
c) links
d) none
b) branches
c) links
d) none
21. A graph consisting 'n' number of nodes, the number of tree branches is n-1
a) n
b) n2
c) n-1
d)2n
22. A network has 7 nodes and 5 independent loops. The number of branches in the network
is 11
a) 11
b) 7
c) 5
d) 12
23. The diagonal elements of bus impedance matrix is called driving point impedances
a) driving point impedances b) transfer impedances c) both
d)none
24. The off diagonal elements of bus impedance matrix is called Transfer impedances
a) driving point impedances b) transfer impedances c) both
26
d)none
25. The matrix consisting of driving point impedances and transfer impedances of the
network of the power system is called bus impedance matrix
a) bus impedance matrix b) loop impedance matrix c)branch impedance matrix d)none
26. --------- is a minimal set of elements of a connected graph, which divides the entire graph
into two parts cut set
a) cut set
b) tie set
c) both
d)none
27. ---------- incidence matrix gives the incidence of element to basic loops of a connected
graph basic loop
a) basic cut set
b) basic loop
d) element node
28. Apply the KCL at every bus for developing the bus----------- matrix admittance
a) impedance
b)admittance
c) both
d)none
b) n-1
c) n-2
d) 2n
30. Apply the KVL at every bus for developing the bus----------- matrix impedance
a) impedance
b)admittance
c) both
d)none
b) un symmetric
c) sparse
27
d) both a and c