CHAPTER 1: NETWORK GRAPHS

1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 Objectives Network Graph Terminology Network Graph Standard Graph Representation Node and Mesh Analysis Tree Branch Selection and Numbering Sequence Fundamental Cut Set Matrix and Fundamental Tie Set Matrix Fundamental Cut Set and Fundamental Loop Analysis Method

1.1 Objectives After going through this chapter, you w ill know the definitions of important terms in Graph Theory that are relevant to Network Analysis. Be able to represent a given network by means of its corresponding graph. Have learnt the important properties of a few subgraphs, in relation to electrical networks. Be in a position to solve a given electrical network by fundamental loop method. Be able to analyze a given network by fundamental cut set method.

1.2

NETWORK GRAPH TERMINOLOGY

Node The basic elements of electric circuit viz. R, L, C are two terminal components, say A and B, as shown in Fig. 1

Fig.1

The terminal in network graph is called as node and represented by (dot). Lines (Branches) In network graph, each electrical element is represented by line; therefore it is quite often called as linear graph. ORIENTED LINES When a component in circuit is shown with an arrow indicating flow of variable, it is called a oriented line. Circuit graph /Network graph Circuit graph / Network graph is interconnection of circuit elements represented by its oriented lines. CONNECTED GRAPH AND SEPARATE GRAPH In any circuit graph, if there is a path between any two nodes it is called a connected otherwise separate graph. Subgraph Any part of the circuit graph is called sub graph. Tree Tree is the set of minimum number of branches required to connect all the nodes in a graph provided the selected branches should not form any loop. Tree is not unique for a given graph. For a graph of n number of nodes, any tree selection will have minimum Bt number of branches, where (1.1) Bt = n 1 Links/ Chords The branches that are not considered in a selected tree are called links or chords. The number of chords is given by (b n + 1) , where b is the total number of branch in the circuit. 2

Cotree: A cotree of a tree is a graph consisting of the chords. Cut set For a given connected graph, cut set is set of branches, on removal of which makes connected graph a separate graph. FUNDAMENTAL CUT SET: Fundamental cut set is a special set of branches containing one tree branch and minimum number of links, such that its removal makes the connected graph unconnected. For a connected graph of n nodes, obviously, number of fundamental cut sets will be n 1 (equal to number of tree branches). Orientation of fundamental cut set Orientation of the fundamental cut set is given same as the orientation of tree branches present in the set Loop For any given connected graph a loop is a closed path connected by branches. FUNDAMENTAL LOOPS: Fundamental loops of a connected graph are loops formed with the tree branches and link when one link is added to the selected tree at a time. Thus for n number of nodes and b number of branches Total number of fundamental loops = b n + 1 = Number of links / chords

(1.2)

Orientation of fundamental loops Orientation of fundamental loop is given similar to orientation of the link, which makes the loop with the tree branches. Tie set: Tie set is the set of fundamental loops.

1.3 NETWORK GRAPH The algorithm for drawing network graph of electric circuit is illustrated through an example. Example: Draw the network graph for the circuit shown in Fig.2
n1 L3
+ e1

n2

C2

C4

R5

i6

n3

Fig. 2
Solution: Algorithm for drawing the network graph: 1. Mark the node n1, n2, and n3 on a separate figure below. 2. Label the component element as 1, 2, 3, ... 3. Connect the component line to the nodes in Fig. 3 4. Identify the passive and active elements. Assign any direction to passive elements. For assigning orientation to active elements follow the rules discussed in section 1.2.
n2

n1

4 5

n3

Fig. 3
Augmented nodal incidence matrix For a connected graph of n nodes and b branches, the augmented matrix A will have dimensions n b and its elements depend on the nature of the orientated graph. The element a ij of the matrix A may be defined as

+ 1 aij = 0 1

If branch j comes out (originates) from node i . If branch j does not at all touching node i . If branch j terminates at node i .

(1.3)

Mesh incidence matrix With the b number of branches and possible l number of loops in the graph the mesh incidence matrix B will be of dimension l b and element bij can be defined as

+ 1 bij = 0 1

If branch j is oriented in the direction of the loop i . If branch j does not appear in loop i . If branch j is oriented opposite to that of the loop i .

(1.4)

1.4 STANDARD BRANCH REPRESENTATION Let us consider standard branch as shown in Fig.4
X A

Vr ir+Ir Ir
Er Zr C

ir,er er

+
B

Y
Y

Fig. 4
From the figure, er = Z r (i r + I r ) E r 1 If = Yr , then equation (1.5) can be written as Zr er E = (i r + I r ) r Zr Zr ir = (er + E r )Yr I r

(1.5)

(1.6)

Equation (1.5) and (1.6) are exact dual and are very significant, as any branch in the network may now be represented as standard branch. If we apply Ohms law to the circuit in Fig.4, Vr = ( I r + i r ) Z r I r + i r = Yr Vr Also Vr = er E r = er + E r (as E r is connected with opposite polarity)

(1.7) (1.8) (1.9)

From equations (1.7) and (1.9) we can write er + E r = ( I r + i r ) Z r ( E r Z r I r ) + er = Z r i r For b numbers of branches, we can write equation (1.10) in matrix form ( E ZI ) + e = Zi E = ( E1 , E 2 ,.....................E n )
T

(1.10)

(1.11)

where

e T = (e1 , e2 ,........................en ) I T = ( I 1 , I 2 ,........................I n ) i T = (i1 , i 2 ,..........................ib )

Z 11 Z= Z nn

Z 22 Z 33

Similarly, from equation (1.8) and (1.9), we can obtain in matrix form ( I YE ) + i = Ye where Y = Z 1
Y11 Y22 = Ynn

(1.12)

Y33

Equation (1.11) and (1.12) are of great use for the analysis of network graph and contain all information regarding any standard branch.

1. 5 NODE AND MESH ANALYSIS 1.5.1 Node Analysis Let us consider Fig. 5.
6 2 1 4 1 2 3 3 4 5 3

Fig. 5

If node 4 is a reference node, then there will be three independent node voltages V1 ,V2 ,V3 (i.e., node 1, 2, 3 with respect to reference node). The branch voltages can be calculated with the help of transpose of augmented incident matrix AT 1 0 0 0 0 1 0 1 0 AT = 0 1 1 0 1 1 0 1 1 It can be proved that e1 e 2 V1 e3 T T e = = A V2 =A V e 4 V3 e5 e 6

(1.13)

where e represent the branch voltages that are now expressed in terms of node voltages. Thus branch current can similarly be obtained form equation (1.12) as i = Ye ( I YE ) = YAT V ( I YE) (1.14) Considering that there is no voltage source in the circuit, equation (1.14) will reduce to i = YAT V I (1.15) Multiplying matrix A on both side of the equation (1.15) Ai = AYAT V AI But Ai = 0 , Therefore, AYAT V = AI where AYAT = Yn = node admittance matrix. Thus
YnV = AI V = Yn1 AI

(1.16)

1.5.2 Mesh Analysis To formulate the mesh equation, let us consider equation (1.11) e = Zi ( E ZI ) where all notations have the usual meaning. Multiplying loop incidence matrix B on both sides of equation (1.17) Be = BZi B( E ZI ) But Be = 0. Therefore, BZi = B ( E ZI )

(1.17)

(1.18) (1.19)

It can also be proved that mesh current im and branch current are related by equation
i = B T im

(1.20)

So,
BZB T im = B( E ZI ) im = ( BZB T ) 1 B( E ZI )
1 im = Z m B( E ZI )

(1.21)

where ( BZB T ) = Z m = mesh impedance matrix and equation (1.21) is called mesh equation. Considering that there is no current source in the circuit, equation (1.21) will reduce to 1 im = Z m BE

Example: Write down the node and mesh equations for the circuit given below.

2
+ 3V

2 2 2
3A

2 2

Fig. 6

Solution: Let us first draw the linear graph

2 1 3

I
1 4 2

II
5 3

III
6

Fig. 7 The current source matrix: I T = [0 0 and voltage source matrix: E T = [3 0 Branch admittance Y will be 1 0 0 0 0 2 0 0 0 12 0 0 1 0 0 0 2 Y = 0 0 0 1 0 2 0 0 0 0 1 2 0 0 0 0 0 0 0 0 3] , 0 0 0 0] 0 0 0 0 0 1 2

Incidence matrix 1 0 0 + 1 0 + 1 A= 0 0 1 1 +1 0 0 1 1 0 1 0 Node G is selected as ground (reference node). To calculate the branch voltage, we use equation (1.13) e = AT V Where e = Branch voltage matrix V = Node voltage matrix However, node voltage matrix V can be obtained from equation (1.12) YnV = A( I YE ) Or AYAT V = AI AYE First we will try to get Yn = node admittance matrix (1.22)

= AYAT 1 0 0 1 1 0 0 1 1 0 = 0 0 1 1 1 0 2 0 0 1 0 0 1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 1 1 0 0 0 1 1 0 1 1 1

1 0 0 1 0 1 = 0 0 1 1 1 0 0 1 0 0 1 1 3 1 1 Yn = 1 1 3 1 2 1 1 3
Let us calculate

1 0 0 0 1 1 0 1 0 1 1 0 0 1 1 0 1 1

1 0 0 1 1 0 0 1 0 AYE = 1 0 0 1 1 1 0 0 2 0 1 0 0 1 1 0 0

0 1 0 0 0 0

0 0 1 0 0 0

0 0 0 1 0 0

0 0 0 0 1 0

0 3 0 0 3 0 0 2 = 0 0 0 0 0 0 1 0

From equation (1.22) 3 1.5 YnV = 0 0 3 0

V1 4.5 3.0 V = Y 1 0 = 0.75 n 2 V 0 . 75 3 3

(1.23)

10

Therefore the branch voltage e1 3.0 e 0.75 2 V1 e3 0 . 75 T = A V2 = 2.25 e 4 V3 1.50 e5 3.75 e 6

Branch current i can be calculated from i = YAT V ( I YE ) = Ye ( I YE ) Calculating

3.0 0.75 0.75 Ye = 1 2 2.25 1.50 3.75

(1.24)

And
1.5 0 0 1 YE = 0 0 3

Thus i1 3.0 1.5 0 i 0.75 0 0.375 2 i3 0.75 0 0.375 = 12 = i 2 . 25 0 4 1.125 i5 1.50 0 0.75 3.75 1.125 i6 3

11

MESH EQUATION:

The mesh incidence matrix 1 0 1 1 0 0 B= 0 11 0 1 0 0 0 0 1 1 1 For calculating the mesh current im, use equation (1. 21) im = ( B Z BT) 1 B ( E ZI ) where Z = Branch impedance matrix 2 0 0 0 0 0 0 2 0 0 0 0 0 0 2 0 0 0 = 0 0 0 2 0 0 0 0 0 0 2 0 0 0 0 0 0 2 First calculating
1 0 1 1 0 0 BZB = 2 0 11 0 1 0 0 0 0 1 1 1
T

(1.25)

1 0 0 0 1 0 3 1 1 11 0 = 2 1 3 1 1 0 1 1 1 3 0 1 1 0 0 1

and B ( E ZI )
1 0 1 1 0 0 0 1 1 0 1 0 = 0 0 0 11 1 3 0 0 0 0 0 0 0 0 0 0 6

12

 1 0 1 1 0 0 = 0 1 1 0 1 0 0 0 0 1 1 1

3 0 0 0 0 6

3 0 0 B ( E ZI] = 0 0 6

3 1 1 3 0 .0 So, im = 1 3 1 = 0 0.375 1 1 3 6 1.125 The branch current can now be calculated by equation (1.20) i = BT im

i i 2 i3 i 4 i5 i 6

1 0 0 0 1 0 1 1 0 = 1 0 1 0 1 1 0 0 1

0.000 0.375 1 . 125

0.000 0.375 0.375 = 1.125 0.750 1.125

Branch voltage can be similarly computed by equation e = Zi ( E ZI ) Compare the results obtained by the nodal equation and mesh equation method.

1.6 TREE BRANCH SELECTION AND NUMBERING SEQUENCE

In order to reduce the complexity and burden in the analysis of the electric network, proper selection of tree branches and numbering sequence is presented below.

13

Tree Branch Selection

I.

Minimum numbers of branches are selected to connect all the nodes in the graph without forming any loop. II. All independent voltage sources should be assigned to tree branch and all current sources should be assigned to cotree. III. As far as possible, the capacitance should be assigned to tree and inductance to cotree. IV. Resistance should find place in tree or cotree suitably.

Numbering sequence

I. II. III. IV.

Normally first number is to be given to all voltage sources. Then, numbering follows to other tree branches. Cotree branches except current source. Current sources are numbered at the end.

The above rules are particularly very helpful in the case of state variable formulation method, which is beyond the scope of the present text.
Langarangian tree: Langarangian tree is defined as a specially selected tree where all tree branches meet at one node.

1.7 FUNDAMENTAL CUT SET MATRIX AND TIE SET MARTIX

For the understanding of fundamental cut set matrix and tie set matrix, let us consider the circuit of example discussed before and draw its linear graph.
2 1

I I
1 4 2

II
5 3

III
6

Fig. 8 The selections of tree branches are as per the tree branch selection scheme and (1,2,3) are selected tree branches. Numbering scheme is followed for assigning the branch number. Based on the above selected tree branch the fundamental cut set equation will be i1 i4 + i6 = 0 i2 + i5 + i6 = 0 i3 + i4 i5 = 0

14

Writing the above fundamental cut set equation in matrix form

1 1 0 0 2 0 1 0 3 4 5 6 0 -1 0 -1 0 0 +1 +1 1 1 -1 0 i1 i2 i3 i4 i5 i6

Branch Number

1 2 3

=0

(1.26)

Fundamental cut set or,

C

it ic

= 0

(1.27)

C i

= 0

where
C = Fundamental cut set matrix i = Branch currents it= Current associated with the tree branches. iC = Current associated with chord branches.

It is observed that entries of it are +1in C matrix. It is to be noted that cut set matrix (C) can be written by inspecting the network graph by defining elements Cij of matrix C as 0 if branch j does not belong to cut set i. Cij = +1 if the orientation of the branch j is same as that of cut set i. -1 if the direction of branch j and cut set i does not match. Student can prove that the relationship between et (tree branch voltage) and branch voltages that are related by equation.
CT et = e

(1. 28)

where CT = Transpose of fundamental cut set matrix et = Tree branch voltage e = Branch voltages Tie set has been already defined as the sets of fundamental loops. From Fig 1.20 and the selected tree (1,2,3), fundamental loop (shown by dotted line) equations are
I e1 e3 + e4 = 0 II -e2 + e3 + e5 = 0 III +e1 e2 + e6 = 0

15

Writing the above equations in matrix form 1 2 3 4 5 6 Branch Number I 1 0 -1 1 0 0 e1 II 0-1 +1 0 1 0 e2 II +1-1 0 0 0 1 e3 = 0 e4 e5 Loops e6 or,
D et D

= 0 et ec = 0

(1. 29)

where D et ec e

= Tie set matrix = Voltage associated with tree branches = Voltage associated with chord branches (cotree) = Branch voltages

It can be observed that entries of chord branch voltages are all one. On the pattern of fundamental cut set matrix the elements of D matrix can also be obtained as 0 if the branch j does not appear in fundamental loop i. +1 if the orientation of the branch j is same as that of loop i. -1 if the orientation of j and loop i differs.

dij =

Student can prove the relationship between chord current and branch current as DT iC = i Where DT = Transpose of tie set matrix iC = Current associated with this chord branches i = Branch currents

(1.30)

1.8 FUNDAMENTAL CUT SET AND FUNDAMENTAL LOOP ANALYSIS METHOD 1.8.1 Fundamental Cut Set Analysis

From Equation (1.12), the branch current i = Ye - (I - YE) Multiplying the above equation by C (cut set matrix) Ci = CYe - C (I-YE)

(1.31)

16

But and

Ci = 0 e = CTet

Therefore, equation (1.31) can be written as CYCTet = C ( I -YE) Ycet = C ( I- YE) et = YC-1 C (I YE) where YC = Cut set admittance matrix. = CYCT Thus, by cut set analysis, we get et = YC-1C (I-YE) e = CTet i = Ye (I-YE) From above equations, all branch voltages and currents can be obtained.

(1.32) (1.33)

1.8.2 Loop Analysis

Fundamental loop analysis is often called Loop analysis method. From equation (1.11) the branch voltage is e = Zi (E ZI) Multiply both sides of above equation by D De = DZi D(E ZI) but and
De = 0 i = DT iC

(1.34)

Thus equation (1.34) can be written as

DZDT iC = D (E- ZI) ZL iC = D (E ZI)

(1.35)

where ZL = DZDT iC = Chord branch current matrix. Therefore by Loop analysis we get iC = ZL-1D (E ZI) i = DT iC e = Zi (E ZI)

17