2

2.1

GRAPH THEORY
Introduction

Graph theory has many applications in several fields such as engineering, physical, social and biological sciences, linguistics etc. Any physical situation that involves discrete objects with interrelationships can be represented by a graph. In Electrical Engineering Graph Theory is used to predict the behaviour of the network in analysis. However, for smaller networks node or mesh analysis is more convenient than the use of graph theory. It may be mentioned that Kirchoff was the first to develop theory of trees for applications to electrical network. The advent of high speed digital computers has made it possible to use graph theory advantageously for larger network analysis. In this chapter a brief account of graphs theory is given that is relevant to power transmission networks and their analysis.

2.2

Definitions

Elemellt of a Graph: Each network element is replaced by a line segment or an arc while constructing a graph for a network. Each line segment or arc is cailed an element. Each
potential source is replaced by a short circuit. Each current source is replaced by an open circuit.

Node or Vertex: The terminal of an element is called a node or a vertex. T.dge: An element of a graph is called an edge. Degree: The number of edges connected to a vertex or node is called its degree.

Graph Theory

Graph: An element is said to be incident on a node, if the node is a terminal of the element. Nodes can be incident to one or more elements. The network can thus be represented by an interconnection of elements. The actual interconnections of the elements gives a graph. Rank: The rank of a graph is n - I where n is the number of nodes in the graph. Sub Graph: Any subset of elements of the graph is called a subgraph A subgraph is said to
be proper if it consists of strictly less than all the elements and nodes of the graph.

Path: A path is defined as a subgraph of connected elements SLlch that not more than two elements are connected to anyone node. If there is a path between every pair of nodes then the graph is said to be connected. Alternatively, a graph is said to be connected if there exists at least one path between every pair of nodes. Planar Graph : A graph is said to be planar, if it can be drawn without-out cross over of
edges. Otherwise it is called non-planar (Fig. 2. J).

(a)

(b)

Fig. 2.1 (a) Planar Graph (b) Non-Planar Graph.

Closed Path or Loop: The set of elements traversed starting from one node and returning to the same node form a closed path or loop. Oriented Graph: An oriented graph is a graph with direction marked for each element Fig. 2.2(a) shows the single line diagram of a simple power network consisting of generating stations. transmission lines and loads. Fig. 2.2(b) shows the positive sequence network of the system in Fig. 2.2(a). The oriented connected graph is shown in Fig. 2.3 for the same system.
r-------,3

(a)

(b)

Fig. 2.2 (a) Power system single-line diagram (b) Positive sequence network diagram

Power System Analysis

~ CD.---+-.......---1~---Q)
4

Fig. 2.3 Oriented connected graph.

2.3

Tree and Co-Tree

Tree: A tree is an oriented connected subgraph of an oriented connected graph containing all the nodes of the graph, but, containing no loops. A tree has (n-I) branches where n is the number of nodes of graph G. The branches of a tree are called twigs. The remaining branches of the graph are called links or chords. Co-tree: The links form a subgraph, not necessarily connected called co-tree. Co-tree is the complement of tree. There is a co-tree for every tree.
For a connected graph and subgraph:
I. There exists only one path between any pair of nodes on a tree ') every connected graph has at least one tree 3. every tree has two terminal nodes and 4. the rank of a tree is n-I and is equal to the rank of the graph.

The number of nodes and the number of branches in a tree are related by b = n-I

..... (2.1 )

If e is the total number of elements then the number of links I of a connected graph with hranches b is given by I==e-h ..... (2.2)

Hence, from eq. (2.1). it can be written that l=e-n+1

..... (2.3)

A tree and the corresponding co - tree of the graph for the system shown in Fig. 2.3 are indicated in Fig. 2.4(a) and Fig. 2.4(b).
5 ._-...----3 ".... /.~ ~

CD

-..-

n = number of nodes = 4

/
2 ..('4

number of elements = 6

b=n-I=4-1=3 I =e-n+I=6-4+1=3

/ /
@

Fig. 2.4 (a) Tree for the system in Fig. 2.3.

Graph Theory
5

CD---+-.....-+-...-:

Fig. 2.4 (b) Co-tree for the system in Fig. 2.3.

2.4

Basic Loops

1\ loop is obtained whenever a link is added to a tree, which is a closed path. As an example to

the tree in Fig. 2.4(a) if the link 6 is added, a loop containing the elements 1-2-6 is obtained. Loops which contain only one link are called independent loops or hasic loops.
It can be observed that the number of basic loops is equal to the number of links given by equation (2.2) or (2.3). Fig. 2.5 shows the basic loops for the tree in Fig. 2.4(a).
..
-

CD

~=--+---~@

.. GL
5

---.

Fig. 2.5 Basic loops for the tree in Fig. 2.4(a).

2.5

Cut-Set

A Cut set is a minimal set of branches K of a connected graph G, such that the removal of all K branches divides the graph into two parts. It is also true that the removal of K branches reduces the rank of G by one, provided no proper subset of this set reduces the rank of G by one when it is removed from G. Consider the graph in Fig. 2.6(a).
._ I

--e
_e

._ (a)

--e

{, ......

I ._ ---e

3 (b)

.--3
(e)

Fig. 2.6

10

Power System Analysis

The rank of the graph = (no. of nodes n - 1) = 4 - I = 3. If branches 1 and 3 are removed two sub graphs are obtained as in Fig. 2.6(b). Thus 1 and 3 may be a cut-set. Also, if branches 1, 4 and 3 are removed the graph is divided into two sub graphs as shown in Fig. 2.6(c) Branches I, 4, 3 may also be a cut-set. In both the above cases the rank both of the sub graphs is 1 + 1 = 2. It can be noted that (I, 3) set is a sub-set of (I, 4, 3) set. The cut set is a minimal set of branches of the graph, removal of which cuts the graph into two parts. It separates nodes of the graphs into two graphs. Each group is in one of the two sub graphs.

2.6

BasiC Cut-Sets

If each cut-set contains only one branch, then these independent cut-sets are called basic cutsets. In order to understand basic cut-sets select a tree. Consider a twig bk of the tree. If the twig is removed the tree is separated into two parts. All the links which go from one part of this disconnected tree to the other, together with the twig bk constitutes a cut-set called basic cut-set. The orientation of the basic cut-set is chosen as to coincide with that of the branch of the tree defining the cut-set. Each basic cut-set contains at least one branch with respect to which the tree is defined which is not contained in the other basic cut-set. For this reason, the n -I basic cut-sets of a tree are linearly independent. Now consider the tree in Fig. 2.4(a). Consider node (1) and branch or twig 1. Cut-set A contains the branch 1 and links 5 and 6 and is oriented in the same way as branch J. In a similar way C cut-set cuts the branch 3 and links 4 and 5 and is oriented in the same direction as branch 3. Finally cut-set B cutting branch 2 and also links 4, 6 and 5 is oriented as branch 2 and the cutsets are shown in Fig. 2.7.
8 5

- - - -"If'--

1~~~4---.@ ~

:;..:----

Fig. 2.7 Cut-set for the tree in Fig. 2.4(a).