7 Graph

Theory

7.1 INTRODUCTION
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’. This theory does not make any distinction between different types
of physical elements of the network but makes the study based on a geometric pattern of the network. 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.

7.2 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 7.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
repre- sents 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. 7.1(c).
7.2 Electrical Networks

Fig. 7.1

7.3 DEFINITIONS ASSOCIATED WITH A GRAPH

1. 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 7.2 shows such graphs.
 Fig. 7.2 Planar graphs
2. Non-planar graph A graph
drawn on a two-dimensional plane is
Graph Theory 7.3
said to be non-planar if there is
intersection of two or more branches
at another point which is not a node.
Figure 7.3 shows non-planar graphs.
3. Sub-graph It is a subset of Fig. 7.3 Non-planar graphs
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 7.4 shows a graph and its proper sub-graph.

(a) Graph (b) Proper sub-graph

Fig. 7.4
4. Path It is an improper sub-graph having the following properties:
(a) At two of its nodes called terminal nodes, there is incident only one
branch of sub-graph.
(b) At all remaining nodes called internal nodes, there are incident two
branches of a graph.
In Fig. 7.5, branches 2, 5 and 6 together with all the four nodes, constitute a
path.
5. Connected graph A graph is said to be connected if there exists a path
between any pair of nodes. Otherwise, the graph is disconnected.
Fig. 7.5
6. Rank of a graph If there are n nodes in a graph, the rank of the graph is (n – 1).
7. 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. 7.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.
8. 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 is the number of nodes in the
graph.

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

Fig. 7.7
9. 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. 7.7(b) and (c) the links are {2, 3, 6} and {1, 4, 6} respectively.
Trees have the following properties:
(1) There exists only one path between any pair of nodes in a tree.
(2) A tree contains all nodes of the graph.
(3) If n is the number of nodes of the graph, there are (n – 1) branches in the tree.
(4) Trees do not contain any loops.
(5) Every connected graph has at least one tree.
(6) The minimum terminal nodes in a tree are two.

7.4 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.

7.4.1 Complete Incidence Matrix (Aa)

For a graph with n nodes and b branches, the complete incidence matrix is a rectangular matrix of order
n × b.
Elements of this matrix have the following values:
aij = 1, if branch j is incident at node i and is oriented away from node i.
= –1, if branch j is incident at node i and is oriented towards node i.
= 0, if branch j is not incident at node i.
For a graph shown in Fig. 7.8, the complete incidence matrix is as given below:

Nodes Branch es →
↓ 1 2 3 4 5 6
1 1 1 0 0 0 1
2 0 –1 1 –1 0 0
3 0 0 0 1 1 –1
4 –1 0 –1 0 –1 0

Fig. 7.8
 é
ê 1ù
Aa = ê 1 1 0 0 0 0
0 -1 1 -1 0 úú
-1
ê 0 0 0 1 1 ú
êë –1 0 -1 0 -1 0 úû
It is seen from the matrix Aa that the sum of the elements in any column is zero. Hence, any one row of
the complete incidence matrix can be obtained by the algebraic manipulation of other rows.
7.4.2 Reduced Incidence Matrix (A)
The reduced incidence matrix A is obtained from the complete incidence matrix Aa by eliminating one of the
rows. It is also called incidence matrix. It is of order (n – 1) × b.
Eliminating the third row of matrix Aa, we get
é 1 1 0 0 0 1ù
A = ê 0 -1 1 -1 0 0 ú
ê ú
ë -1 0 -1 0 -1 0 û
 When a tree is selected for the graph as shown in
Fig. 7.9, the incidence matrix is obtained by
arranging a column such that the first (n – 1) column
corresponds to twigs of the tree and the last b – (n – Twigs: {2, 3, 4}
1) branches corresponds to the links of the selected Links: {1, 5, 6}
tree.

Twigs Links
2 3 4 1 5 6 Fig. 7.9
é 1 0 0 1 0 1ù
A = ê–1 1 –1 0 0 0 ú
ê ú
ë 0 –1 0 –1 –1 0 û
The matrix A can be subdivided into submatrices At and Al.
A = [At : Al]
where At the is twig matrix whereas Al is the link matrix.

7.4.3 Number of Possible Trees of a Graph

Let the transpose of the reduced incidence matrix A be AT. It can be shown that the number of possible trees
of a graph will be given by

Number of possible trees =

T
AA
For the graphs shown in Fig. 7.8, the reduced incidence matrix is given by
é 1 1 0 0 0 1ù
ê
A = 0 -1 1 -1 0 0 ú
ê 0ú
ë -1 0 -1 0 -1 û
Then transpose of this matrix will be

é1 0 –1ù
ê1 –1 0ú
ê ú
T
A = ê 0 1 –1 ú
ê0 –1 0ú
ê ú
ê0 0 –1
êë 1 0 0úúû
 Hence, number of all possible trees of the graph
é1 0 –1ù
ê1 –1 0ú
é 1 1 0 0 0 1ù ê ú é 3 –1 –1ù
ê 0 1 –1 ú
AA = ê 0 –1 1 –1 0
T
0ú = ê –1 3 –1ú
ê ú ê0 –1 0ú ê ú
ë–1 0 –1 0 –1 0û ê 1ú ë –1 –1 3 û
ê0 0 – ú
êë 1 0 0úû
3 –1 –1
T
AA = –1 3 –1 = 3 (9 – 1) + (1) (–3 – 1) – 1 (1 + 3) = 16
–1 –1 3
Thus, 16 different trees can be drawn.

7.5 LOOP MATRIX OR CIRCUIT MATRIX

When a graph is given, it is possible to tell which branches constitute which loop or circuit. Alternately, if a
loop matrix or circuit matrix is given, we can reconstruct the graph.
For a graph having n nodes and b branches, the loop matrix Ba is a rectangular matrix of order b columns
and as many rows as there are loops.
Its elements have the following values:
bij = 1, if branch j is in loop i and their orientations coincide.
= –1, if branch j is in loop i and their orientations do not coincide.
= 0, if branch j is not in loop i.
A graph and its loops are shown in Fig. 7.10.

Loop 1: {1, 2, 3}
Loop 2: {3, 4, 5}
Loop 3: {2, 4, 6}
Loop 4: {1, 2, 4, 5}
Loop 5: {1, 5, 6}
Loop 6: {2, 3, 5, 6}
Loop 7: {1, 3, 4, 6}

Fig. 7.10

All the loop currents are assumed to be flowing in a clockwise direction.

Loops Branches ®
¯ 1 2 3 4 5 6
1 –1 1 1 0 0 0
2 0 0 –1 –1 1 0
3 0 –1 0 1 0 1
4 –1 1 0 –1 1 0
5 –1 0 0 0 1 1
6 0 –1 –1 0 1 1
7 –1 0 1 1 0 1
 é -1 1 1 0 0 0ù
ê0 0 -1 -1 1 0 ú
ê ú
ê0 -1 0 1 0 1
ê-1 1 0 -1 1 0ú
ú
Ba =
ê -1 0 0 0 1 1úú
ê
ê 0 -1 -1 0 1 1ú
ê ë -1 0 1 1 0 1úû

7.5.1 Fundamental Circuit (Tieset) and Fundamental Circuit Matrix

When a graph is given, first select a tree and remove all the links. When a link is replaced, a closed loop or
circuit is formed. Circuits formed in this way are called fundamental circuits or f-circuits or tiesets.
Orientation of an f-circuit is given by the orientation of the connecting link. The number of f-circuits is
same as the number of links for a graph. In a graph having b branches and n nodes, the number of f-circuits
or tiesets will be (b – n + 1). Figure 7.11 shows a tree and f-circuits (tiesets) for the graph shown in Fig.

7.10.

Fig. 7.11
Here, b = 6 and n = 4.
Number of tiesets = b – n + 1
=6–4+1=3
f-circuits are shown in Fig. 7.11. The orientation of each f-circuit is given by the orientation of the
corresponding connecting link. Writing the tieset, with the link as the first entry and other branches in sequence,
we have
tieset 1: {1, 2, 3}
tieset 5: {5, 3, 4}
tieset 6: {6, 2, 4}
Then, the tieset schedule will be written as

Tiesets Branches ®
¯ 1 2 3 4 5 6
1 1 –1 –1 0 0 0
5 0 0 –1 -1 1 0
6 0 -1 0 1 0 1
Hence, an f-circuit matrix or tieset matrix will be given as
é1 –1 –1 0 0 0ù
ê 1 0ú
B = ê 0 0 –1 –1 ú
ë 0 –1 0 1 0 1û
 Usually, the f-circuit matrix B is rearranged so that the first (n – 1) columns correspond to the twigs and
b – (n – 1) columns to the links of the selected tree.
Twigs Links
2 3 4 1 5 6
é -1 –1 0 1 0 0 ù
B = ê 0 –1 – 1 0 1 ú
ê 0ú
ë -1 0 1 0 0 1 û
The matrix B can be partitioned into two matrices Bt and Bl.
B = [ Bt : Bl ]
= [ Bt : U ]
where Bt is the twig matrix, Bl is the link matrix and U is the unit matrix.
7.5.2 Orthogonal Relationship between Matrix A and Matrix B
For a linear graph, if the columns of the two matrices Aa and Ba are arranged in the same order, it can be
shown that
Aa B aT = 0
or Ba A aT = 0
The above equations describe the orthogonal relationship between the matrices Aa and Ba.
If the reduced incidence matrix A and the f-circuit matrix B are written for the same tree, it can be shown
that
A BT = 0
or B AT = 0
These two equations show the orthogonal relationship between matrices A and B.

7.6 CUTSET MATRIX

Consider a linear graph. By removing a set of branches without affecting the nodes, two connected sub-
graphs are obtained and the original graph becomes unconnected. The removal of
this set of branches which results in cutting the graph into two parts are known as a
cutset. The cutset separates the nodes of the graph into two groups, each being in
one of the two groups.
Figure 7.12 shows a graph.
Branches 1, 3 and 4 will form a cutset. This set of branches separates the graph
into two parts. One having an isolated Node 4 and other part having branches 2 and Fig. 7.12
5 and nodes 1, 2 and 3.
Similarly, branches 1 and 2 will form a cutset. Each branch of the cutset has one of its terminals incident
at a node in one part and its other end incident at other nodes in the other parts. The orientation of a cutset
is made to coincide with orientation of defining branch.
For a graph having n nodes and b branches, the cutset matrix Qa is a rectangular matrix of order b
columns and as many rows as there are cutsets. Its elements have the following values:
qij = 1, if branch j is in the cutset i and the orientations coincide.
= –1, if branch j is in the cutset i and the orientations do not coincide.
= 0, if branch j is not in the cutset i.
Figure 7.13 shows a directed graph and its cutsets.
 Cutsets Bra nche ®
Cutset 1: {1, 2, 6}
¯ 1 2 3 s 5 6
Cutset 2: {2, 3, 4}
1 1 1 0 40 0 1 Cutset 3: {3, 1, 5}
2 0 1 –1 1 0 0 Cutset 4: {4, 5, 6}
3 1 0 1 0 1 0 Cutset 5: {5, 2, 3, 6}
4 0 0 0 1 1 –1 Cutset 6: {6, 1, 3, 4}
5 0 –1 1 0 1 –1
6 1 0 1 –1 0 1

Fig. 7.13
For the cutset 2, which cuts the branches 2, 3 and 4 and is shown by a dotted circle, the entry in the
cutset schedule for the branch (2) is 1, since the orientation of this cutset is given by the orientation of the
branch 2 and hence it coincides. The entry for branch 3 is –1 as orientation of branch 3 is opposite to that of
cutset 2 i.e. branch 2 goes into cutset while branch 3 goes out of cutset. The entry for the branch 4 is 1 as
the branch 2 and the branch 4 go into the cutset. Thus their orientations coincide.
Hence, the cutset matrix Qa will be given as
é1 1 0 0 0 1ù
ê0 1 –1 1 0 0ú
ê ú
0 1 0 1 0
ê1 ú
ê0 0 0 1 1 –1 ú
 Qa =
ê 0 –1 1 0 1 –1 úú
ê
êë 1 0 1 –1 0 1 úû

7.6.1 Fundamental Cutset and Fundamental Cutset Matrix

When a graph is given, first select a tree and note down its twigs. When a twig is removed from the tree, it
separates a tree into two parts (one of the separated part may be an isolated node). Now, all the branches
connecting one part of the disconnected tree to the other along with the twig removed constitutes a cutset.
This set of branches is called a fundamental cutset or f-cutset. A matrix formed by these f-cutsets is called
an f-cutset matrix. The orientation of the f-cutset is made to coincide with the orientation of the defining
branch, i.e., twig. The number of f-cutsets is the same as the number of twigs for a graph.
Figure 7.14 shows a graph, selected tree and f-cutsets corresponding to the selected tree.

Fig. 7.14
7.10 Electrical Networks

f-cutset 2: {2, 1, 6}
f-cutset 3: {3, 1, 5}
f-cutset 4: {4, 5, 6}
The cutset schedule is written as below:
f -cutsets Branche s ®
¯ 1 2 3 4 5 6
2 1 1 0 0 0 1
3 1 0 1 0 1 0
4 0 0 0 1 1 –1
Hence, the f-cutset matrix Q is given by
é 1 1 0 0 0 1ù
Q = ê 1 0 1 0 1 0ú
ê ú
ë 0 0 0 1 1 –1û
The f-cutset matrix Q is rearranged so that the first (n – 1) columns correspond to twigs and b – (n – 1)
columns to links of the selected tree.
Twigs Links
2 3 4 1 5 6
é1 0 0 1 0 1 ù
Q = ê0 1 0 1 1 0 ú
ê ú
ë0 0 1 0 1 -1 û
The matrix Q can be subdivided into matrices Qt and Ql.
Q = [ Qt : Ql ]
= [ U : Ql ]
where Qt is the twig matrix, Ql is the link matrix and U is the unit matrix.
7.6.2 Orthogonal Relationship between Matrix B and Matrix Q
For a linear graph, if the columns of two matrices Ba and Qa are arranged in the same order, it can be shown
that
Qa BaT = 0
or Ba QaT = 0
If the f-circuit matrix B and the f-cutset matrix Q are written for the same selected tree, it can be shown
that
B QT = 0
or Q BT = 0
These two equations show the orthogonal relationship between matrices A and B.

7.7 RELATIONSHIP AMONG SUBMATRICES OF A, B AND Q

Arranging the columns of matrices A, B and Q with twigs for a given tree first and then the links, we get the
partitioned forms as
A = [ At : Al ]
B = [ Bt : Bl ] = [ Bt : U]
Q = [ Qt : Ql ] = [ U : Ql ]
From the orthogonal relation, ABT = 0, we get
 Graph Theory 7.11

é Tù
ABT = [ A : A ] ê Bt ú
t l Tl
At B T + Al B T = 0 êë B úû
t lT T
At B = – Al B
t l
Since At is non-singular, i.e., | A | ≠ 0,
At –1 exists
Premultiplying with At –1, we get
B T = – A –1 A B T
t t l l
t
 Bt = – Bl (A –1 ⋅ Al)T
Since Bl is a unit matrix
7.12 Electrical Networks
Hence, matrix B is written as Bt = – (A –1
t
⋅ Al)T

B = [– (A –1 ⋅ A )T : U] …(7.1)
t l
We know that ABT =0
Al B T = – At B T
l t
Postmultiplying with (B lT)–1
Al = – At B T (B T)–1
t l
= – At B T (B –1)T = – At (B –1 ⋅ Bt)T
t l l
Hence matrix A can be written as
A = [ At : – At (B –1 T
l ⋅ Bt) ]
= At [ U : – (B l ⋅ Bt)T ]
–1
…(7.2)
Similarly we can prove that
Q = [ U : – (Bl –1⋅ Bt) ] …(7.3)
From Eqs (7.2) and (7.3), we can write
A = At Q …(7.4)
Q = A t–1 A …(7.5)
= A –1 [ A : A ]
t t l
= [ U : A –1 A ] …(7.6)
t l
–1 T
We have shown that Bt = – (A t ⋅ A l )
BtT = – (A –1
t ⋅ Al)
Hence Q can be written as
Q = [ U : –B tT ]
Ql = –BtT …(7.7)

Example 7.1 For the circuit shown in Fig. 7.15, draw the oriented graph and write the (i) incidence
matrix, (ii) f-cutset matrix, and (iii) tieset matrix.
Fig. 7.15
Solution For drawing the oriented graph,
(1) replace all resistors, inductors and capacitors by line segments,
(2) replace the voltage source by short circuit and the current source by an
open circuit,
(3) assume the directions of branch currents arbitrarily, and
(4) number all the nodes and branches.
Complete Incidence Matrix (Aa)

Nodes Branches
¯ 1 2 3 ® Fig. 7.16
1 –1 0 –1 41
2 0 1 1 –1
3 1 –1 0 0
ê
A = é –1 0 –1 1 ù
0 1 1 –1 ú
a ê ú
ë 1 –1 0 0 û
Eliminating the third row from the matrix Aa, we get the incidence matrix A.
é–1 0 –1 1 ù
A= 0 1 1 –1
Tieset Matrix úû
Twigs: {1, 2}
ê Links: {3, 4}
(B) ë
Tieset 3:{3, 1, 2}
1 2 3 4
3é –1 –1 1 0ù Tieset 4:{4, 1, 2}
B= ê
4 ë 1 1 0 1 úû

f-cutset Matrix
(Q) Fig. 7.17

f-cutset 1: {1, 3, 4}
f-cutset 2: {2, 3, 4}

Fig. 7.18

1 2 3 4
1 é1 0 1 –1ù
Q= ê
2 ë 0 1 1 –1û

Example 7.2 For the network shown in Fig. 7.19, draw the oriented graph and write the
(i) incidence matrix, (ii) tieset matrix, and (iii) f-cutset matrix.
 Fig. 7.19

Solution For drawing the oriented graph,

(1) replace all resistors, inductors and capacitors by line segments,
(2) replace all voltage sources by short circuits and current source by an
open circuit,
(3) assume directions of branch currents arbitrarily, and
(4) number all the nodes and branches.
Complete Incidence Matrix (Aa)
Fig. 7.20
Nodes B anc es ®
¯ 1 2 r h 5 6 7
1 1 0 03 14 0 1 0
2 –1 –1 1 0 0 0 0
3 0 1 0 0 1 0 1
4 0 0 –1 –1 –1 0 0
5 0 0 0 0 0 –1 –1
é1 0 0 1 0 1 0ù
ê–1 –1 1 0 0 0 0 ú
ê ú
Aa = ê 0 1 0 0 1 0 1 ú
ê 0 0 –1 –1 –1 0 0 ú
ê –1 –1 ú
ë 0 0 0 0 0 û
Eliminating the last row from the matrix Aa, we get the incidence matrix A.
é 1 0 0 1 0 1 0ù
ê–1 –1 1 0 0 0 0ú
A= ê ú
0 1 0 0 1 0 1
ê ú
êë 0 0 –1 –1 –1 0 0ú
Tieset Matrix (B) û

1 2 3 4 5 6 7
2é0 1 1 0 –1 0 0 Twigs: {1, 3, 5, 6}
B = 4 ê–1 0 –1 1 0 0 ù Links: {2, 4, 7}
ê ú
7 1 0 1 0 –1 –1 10 Tieset 2: {2, 3, 5}
û
Tieset 4: {4, 1, 3}
ë Tieset 7: {7, 6, 1, 3, 5}

Fig. 7.21
7.14 Electrical Networks

f-cutset Matrix
(Q)
 f-cutset 1: {1, 4, 7}
1 2 3 4 5 6 7
f-cutset 3: {3, 4, 7, 2}
1é1 0 0 1 0 0 –1ù f-cutset 5: {5, 2, 7}
3 ê0 –1 1 1 0 0 –1ú Graph 6:
f-cutset Theory
{6, 7} 7.15
Q= ê
5 ê0 1 0 0 1 0 1ú
ú
6 0 0 0 0 1 1 úû

Fig. 7.22
Example 7.3 For the circuit shown in Fig. 7.23, (i) draw its graph, (ii) draw its tree, and (iii) write the
fundamental cutset matrix.

Fig. 7.23
Solution For drawing the oriented graph,
(1) replace all resistors, inductors and capacitors by line segments,
(2) replace the current source by an open circuit,
(3) assume directions of branch currents, and
(4) number all the nodes and branches.

Fundamental Cutset Matrix (Q)

Fig. 7.24

Twigs: {2, 4, 5}
Links: {1, 3, 6}
f-cutset 2: {2, 1, 3}
f-cutset 4: {4, 3, 6}
f-cutset 5: {5, 1, 6}

Fig. 7.25

1 2 3 4 5 6
2 é1 1 1 0 0 0ù
ê 0 –1 1 0 1 ú
Q = 4ê 0 ú
5 ë1 0 0 0 1 1û
 Example 7.4 For the circuit shown in Fig. 7.26, draw the oriented graph and write (i) incidence matrix,
(ii) tieset matrix, and (iii) cutset matrix.
 Fig. 7.26
Solution For drawing the oriented graph,
(1) replace all resistors, inductors and capacitors by line segments,
(2) replace voltage source by short circuit and current source by an open
circuit,
(3) assume directions of branch currents arbitrarily, and
(4) number the nodes and branches.
Complete Incidence Matrix (Aa)
Nodes Bra ches ® Fig. 7.27
¯ 1 n 3 4
1 –1 12 0 –1
2 0 0 1 1
3 1 –1 –1 0
é –1 1 0 –1ù
Aa = ê 0 0 1 1ú
ê ú
ë 1 –1 –1 0 û
Eliminating the third row from the matrix Aa, we get the incidence matrix A.
é–1 1 0 –1ù
A=
êë 0 0 1 1 úû
Tieset Matrix
(B)

Twigs: {2, 4}
Links: {1, 3}
Tieset 1: {1, 2}
Tieset 3: {3, 2, 4}

Fig. 7.28

1 2 3 4
B= 1 é 1 1 0 0ù
3 –1 1 –
 f-cutset 2: {2, 1, 3}
f-cutset 4: {4, 3}

Fig. 7.29

1 2 3 4
2 é –1 1 1 0 ù
Q=
4 êë 0 0 1 1úû

Example 7.5 The graph of a network is shown in Fig. 7.30. Write the (i) incidence matrix, (ii) f-cutset
matrix, and (iii) f-circuit matrix.
 Fig. 7.30
Solution
Complete Incidence Matrix
(Aa)
1 2 3 4 5 6
1 é–1 1 0 1 0 0ù
2ê 0 0 0 –1 1 1ú
Aa= ê ú
3ê 0 –1 1 0 –1 0 ú
4 êë 1 0 –1 0 0 –1úû
The incidence matrix A is obtained by eliminating any row from the matrix Aa.
é –1 1 0 1 0 0ù
A= ê 0 0 0 –1 1 1ú
ê ú
ë 0 –1 1 0 –1 0 û
Twigs: {4, 5, 6}
Tieset Matrix Links: {1, 2, 3}
Tieset 1: {1, 4, 6}
(B) 1 2 3 4 5 6 Tieset 2: {2, 4, 5}
1 é1 0 0 1 0 1ù Tieset 3: {3, 5, 6}
B = 2 ê0 1 0 –1 –1 0 úú
ê
3 ë0 0 1 0 1 –1 û
Fig. 7.31
f-cutset Matrix (Q)
1 2 3 4 5 6
f-cutset 4: {4, 1, 2}
4 é -1 1 0 1 0 0ù
f-cutset 5: {5, 2, 3}
Q= 5ê0 1 -1 0 1 0ú
ú f-cutset 6: {6, 1, 3}
6 êë 1 0 1 0 0 1û
-

Fig. 7.32
Example 7.6 For the graph shown, write the incidence matrix, tieset matrix and f-cutset matrix.

Fig. 7.33
Solution
Complete Incidence Matrix (Aa)
1 2 3 4 5 6 7
1 é 1 1 0 0 0 0 0ù
2 ê 0 –1 1 0 1 0 0 ú
ê ú
0 0 –1 1 0 0
Aa = 3 ê 0ú
4 ê 0 0 0 –1 –1 1 –1ú
ê ú
5 ë –1 0 0 0 0 –1 1 û
The incidence matrix A is obtained by eliminating any row from the matrix Aa.
é 1 1 0 0 0 0 0ù
ê0 –1 1 0 1 0 0 ú
A= ê ú
ê 0 0 –1 1 0 0 0 ú
êë 0 0 0 –1 –1 1 –1úû
Tieset Matrix (B)
Twigs: {1, 2, 3, 4}
Links: {5, 6, 7}
Tieset 5: {5, 3, 4}
Tieset 6: {6, 1, 2, 3, 4}
Tieset 7: {7, 1, 2, 3, 4}
1 2 3 4 5 6 7
5 é 0 0 –1 –1 1 0 0 ù
B = 6 ê –1 0ú
ê 1 1 1 0 1 ú
7 ë 1 –1 –1 –1 0 0 1û
 f-cutset 1: {1, 6, 7}
f-cutset 2: {2, 6, 7}
f-cutset 3: {3, 5, 6, 7}
f-cutset 4: {3, 5, 6, 7}

Fig. 7.34

1 2 3 4 5 6 7
1 é1 0 0 0 0 1 –1 ù
2 ê0 1 0 0 0 –1 1 ú
Q = 3 ê0 0 1 0 1 –1 1
ú
ê ú
4 0 0 1 1 –1 1 úû

Example 7.7 For the graph shown, write the incidence matrix,tieset matrix and f-cutset matrix.

Fig. 7.35
Solution
Complete Incidence Matrix (Aa)
1 2 3 4 5 6 7 8
1é1 0 0 –1 1 0 0 0 ù
2 ê –1 1 0 0 0 1 0 0ú
ê ú
3 0 –1 1 0 0 0 1 0
Aa = 4 ê ê ú
0 0 –1 1 0 0 0 1 úú
ê
5 ë 0 0 0 0 –1 –1 –1 –1
û
The incidence matrix is obtained by eliminating any one row.
é 1 0 0 –1 1 0 0 0 ù
ê –1 1 0 0 0 1 0 0 ú
A= ê ú
ê 0 –1 1 0 0 0 1 0 ú
ëê 0 0 –1 1 0 0 0 1úû
Tieset Matrix (B)
Twigs: {1, 3, 5, 7} 2 3 4 5 6 7 8
Links: {2, 4, 6, 8}
Tieset 2: {2, 7, 5, 1} 2 é11 1 0 0 –1 0 1 0ù
Tieset 4: {4, 5, 7, 3} 4 ê0 0 1 1 1 0 –1 0úú
B= ê
Tieset 6: {6, 5, 1} 6ê1 0 0 0 –1 1 0 0ú
Tieset 8: {8, 7, 3} 8 0 1 0 0 0 –1 1ú
êë 0 û
f-cutset Matrix (Q)
 f-cutset 1: {1, 6, 2}
f-cutset 3: {3, 4, 8}
f-cutset 5: {5, 4, 6, 2}
Fig. 7.36 f-cutset 7: {7, 2, 8, 4}

1 2 3 4 5 6 7 8
1 é1 –1 0 0 0 –1 0 0 ù
3 ê0 0 1 –1 0 0 0 –1 ú
ê ú
Q= 5 0 1 0 –1 1 1 0
ê7 –1 0 1 0 0 1 10 ú
úû

Example 7.8 How many trees are possible for the graph of the network of Fig. 7.37?

Fig. 7.37

Solution To draw the graph,

(1) replace all resistors, inductors and capacitors by line segments,
(2) replace voltage source by short circuit and current source by an open
circuit,
(3) assume directions of branch currents arbitrarily, and
(4) number all the nodes and branches.

Fig. 7.38
7.20 Electrical Networks
Complete Incidence Matrix (Aa)
1 2 3 4
1 é 1 0 –1 1 ù Graph Theory 7.21
Aa = 2 ê–1 1 0 0 ú
ê ú
3 ë 0 –1 1 –1 û
The reduced incidence matrix A is obtained by eliminating the last row from matrix Aa.
é 1 0 –1 1ù
A= ê
ë –1 1 0 0 úû
The number of possible trees = T
AA .
é 1 –1 ù
é 1 0 –1 1 ù êê 0 1 úú é 3 –1ù
AAT = êë–1 1 0 0 úû 1 0 = êë –1 2 úû
ê– ú
êë 1 0 úû
3 –1
AA
T = = 6 – 1 = 5.
–1 2

Example 7.9 Draw the oriented graph from the complete incidence matrix given below:
Nodes Branches ®
¯ 1 2 3 4 5 6 7 8
1 1 0 0 0 1 0 0 1
2 0 1 0 0 –1 1 0 0
3 0 0 1 0 0 –1 1 –1
4 0 0 0 1 0 0 –1 0
5 –1 –1 –1 –1 0 0 0 0

Solution First, note down the nodes 1, 2, 3, 4, 5 as shown in

Fig. 7.39. From the complete incidence matrix, it is clear that the
branch number 1 is between nodes 1 and 5 and it is going away
from Node 1 and towards Node 5 as the entry against Node 1 is 1
and that against 5 is –1. Hence, connect the nodes 1 and 5 by a
line, point the arrow towards 5 and call it Branch 1 as shown in
Fig.
7.39. Similarly, draw the other oriented branches.
Fig. 7.39
Example 7.10 The reduced incidence matrix of an oriented
graph is given below. Draw the graph.
é
A = ê 0 –1 1 1 0úù
0 0 –1 –1 –1
ê ú
ë –1 0 0 0 1 û
Solution First, writing the complete incidence matrix from the matrix A such that the sum of all entries in
each column of Aa will be zero,we have
 1 2 3 4 5
1 é 0 –1 1 1 0 ù
2 ê 0 0 –1 –1 –1 ú
A = ê ú
a
3 ê–1 0 0 0 1 ú
4 ê ë 1 1 0 0 0 úû
Now, the oriented graph can be drawn with matrix Aa.
 Example 7.11 The reduced incidence matrix of an oriented graph is
Fig. 7.40
é 0 –1 1 0 0 ù
A= ê 0 0 –1 –1 –1 ú
ê ú
ë –1 0 0 0 1 û
(i) Draw the graph. (ii) How many trees are possible for this graph? (iii) Write the tieset and cutset
matrices.
Solution First, writing the complete incidence matrix Aa such that the sum of all the entries in each
column of Aa is zero, we have
1 2 3 4 5
1 é 0 –1 1 0 0 ù
2 ê 0 0 –1 –1 –1 ú
Aa = 3 êê –1 ú0 0 0 1 ú
4ê 1 1 0 1 0 úû
ë
Now, the oriented graph can be drawn with the matrix Aa.
The number of possible trees = AA Fig. 7.41
T

é 0 0 –1 ù
0 –1 1 0 0 ê–1 0
ê úú 2 –1 0 ú
AAT = êé 0 0 –1 –1 –1 úù 1 –1 00 = éê–1 3 –1 ù
ê ú ê ú ê ú
ë –1 0 0 0 1 û ê 0 –1 0 ú ë 0 –1 2 û
ê 0 –1 1 ú
ë û
2 –1 0
AA =
T –1 3 –1 = 2 (6 – 1) + 1 (–2) = 8
0 –1 2
The number of possible trees = 8.
Tieset Matrix (B)

1 2 3 4 5
B=
12éê1 0 0 1 0 1 –1–1 1ù
ë
Twigs: {3, 4, 5}
0 úû Links: {1, 2}
Tieset 1: {1, 4, 5}
Tieset 2: {2, 3, 4}
Fig. 7.42
f-cutset Matrix (Q)
1 2 3 4 5
3 é 0 –1 1 0 0ù f-cutset 3: {3, 2}
f-cutset 4: {4, 2, 1}
Q= 4ê 1 1 0 1 0ú
ê ú f-cutset 5: {5, 1}
5 ë–1 0 0 0 1û

Fig. 7.43
Example 7.12 The fundamental cutset matrix of a network is given as follows:
Twigs Links
a c e b d f
1 0 0 1 0 1
0 1 0 0 1 1
0 0 1 1 1 1
Draw the oriented graph.
Solution
 No. of links l = b – n + 1
No. of nodes n = b – l + 1
=6–3+1=4
f-cutsets are written as, Twigs: {a, c, e}
Links: {b, d, f}
f-cutset a: {a, b, f}
f-cutset c: {c, d, f}
f-cutset e: {e, b, d, f}
The oriented graph is drawn as Fig. 7.44

Example 7.13 Draw the oriented graph of a network with the f-cutset matrix as shown below:
Twigs Links
1 2 3 4 5 6 7
1 0 0 0 –1 0 0
0 1 0 0 1 0 1
0 0 1 0 0 1 1
0 0 0 1 0 1 0
Solution
No. of links l=b–n+ 1
No. of nodes n=b–l+1=7–3+1 =5
f-cutsets are written as
f-cutset 1: {1, 5}
f-cutset 2: {2, 5, 7}
f-cutset 3: {3, 6, 7}
f-cutset 4: {4, 6}
Then oriented graph can be drawn as Twigs: {1, 2, 3, 4}
Links: {5, 6, 7}

Fig. 7.45
7.8 KIRCHHOFF’S VOLTAGE LAW
KVL states that if vk is the voltage drop across the kth branch, then
Σ vk = 0 …(7.8)
the sum being taken over all the branches in a given loop. If l is the number of loops or f-circuits, then there
will be l number of KVL equations, one for each loop. The KVL equation for the f-circuit or loop ‘i’ can be
written as
 åb bik vk =0 (h = 1, 2, …, l)
k =1
where bik is the elements of the tieset matrix B, b being the number of branches. The set of l KVL equations
can be written in matrix form.
B Vb = 0 …(7.9)
é v1 ù
êv ú
2
where Vb = ê ú is a column vector of branch voltages.
M
ê ú
êëvb úû
and B is the fundamental circuit matrix.

7.9 KIRCHHOFF’S CURRENT LAW

KCL states that if ik is the current in the kth branch then at a given node
Σik = 0 …(7.10)
the sum being taken over all the branches incident at a given node. If there are ‘n’ nodes, there will ‘n’ such
equations, one for each nodes
b
å aik ik = 0 (h = 1, 2, …, n)
k =1
so that set of n equations can be written in matrix form.
Aa Ib = 0 …(7.11)
é i1 ù
êi ú
2
where Ib = ê ú is a column vector of branch currents.
ê úM
ê ë ib ú û
and Aa is the complete incidence matrix.
If one node is taken as reference node or datum node, we can write the equation (7.11) as,
A Ib = 0 …(7.12)
where A is the incidence matrix of order (n – 1) × b.
We know that A = At Q
Equation (7.12) can be written as
At Q ⋅ Ib = 0
–1
Premultiplying with At–1 , we get
A A Q I = A –1 ⋅ 0
t t b t
I Q Ib = 0
Q Ib = 0 …(7.13)
where Q is the f-cutset matrix.
7.10 RELATION BETWEEN BRANCH VOLTAGE MATRIX Vb,
TWIG VOLTAGE MATRIX Vt AND NODE VOLTAGE MATRIX
Vn
We know that B Vb = 0
é Vt ù
[ Bt : Bl ] êêLúú = 0
êëV l úû
Bt Vt + Bl Vl = 0
Bl Vl = – Bt Vt
 Premultiplying with B l–1.
Vl = – B l–1–1Bt Vt
= – (B B ) V …(7.14)
l t t
éVt
ù
Now Vb = êL
ú ê
ú
êëV l úû
é ù é ù
ê Vt ú ê U ú
= ê ................ ú = ê .............. ⋅V
úú t
–1
–– B B V B B
–1

ëê ( l t )t úû ëê ( l )t ú
û
T
Vb = Q Vt …(7.15)
Also, Q = A t–1 A
QT = AT (At –1) T
= AT (At T) –1
Hence the Eq. (7.15) can be written as
Vb = AT (At )T –1Vt
= AT {(At T) –1 Vt}
= AT Vn …(7.16)
where Vn = (At )T –1Vn is node voltage matrix.

7.11 RELATION BETWEEN BRANCH CURRENT MATRIX Ib AND

LOOP CURRENT MATRIX Il
We know that, A Ib = 0
é It ù
[ At : Al ] êêLúú = 0
ê ë Il ú û
At It + Al Il = 0
At It = – Al Il
Premultiplying with A t–1.
–1
It = – At–1 AI
= – (A A l) lI …(7.17)
t l l
é It
ù
Now Ib = êL
ú ê
ú
ê ë Il ú û
 é– ( A –1 A )I ù é – ( A –1 A ) ù
t l l t l
= êê.................. úú = êê..................úú⋅ Il

ëê Il ûú êë U úû
T
Ib = B Il …(7.18)

7.12 NETWORK EQUILIBRIUM EQUATION

7.12.1 KVL Equation
(1) If there is a voltage source vsk in the branch k having impedance
zk and carrying current ik then
vk = zk ik – vsk (k = 1, 2, …, b) …(7.19)
In matrix form,
Vb = Zb Ib – Vs …(7.20)
where Zb is the branch impedance matrix, Ib is the column vector of Fig. 7.46
branch currents and Vs is the column vector of source voltages. Hence, KVL equation can be written as
B Vb = 0
B (Zb Ib – Vs) = 0
B Zb Ib = BVs
Also, Ib = BT Il
T
B Zb B Il = B Vs …(7.21)
Z Il = E
where E = B Vs
and Z = B Zb BT
The matrix Z is called loop impedance matrix.
(2) If there is a voltage source in series with an impedance and a current source in parallel with the
combination as shown in Fig. 7.47,
(vk + vsk )
ik = – isk
zk
vk = zk ik + zk isk – vsk …(7.22)
In matrix form, we can write,
Vb = Zb Ib + Zb Is – Vs …(7.23)
KVL equation is B Vb = 0
BVb = B (Zb Ib + Zb Is – Vs) = 0
B Zb Ib = B Vs – B Zb Is Fig. 7.47
Now Ib = BT Il
B Zb BT Il = B Vs – B Zb Is …(7.24)
Z Il = B Vs – B Zb Is
where Z = B Zb BT is the loop impedance matrix. This is the generalised KVL equation.
7.12.2 KCL Equation
(1) If the branch k contains an input current source isk and an admittance yk, then
ik = yk vk – isk (k = 1, 2, …, b) …(7.25)
In the matrix form,
Ib = Yb Vb – Is …(7.26)
where Yb is the branch admittance matrix.
Hence KCL equation is given by,
A Ib = 0
A (Yb Vb – Is) = 0
A Yb Vb = A Is
Also Vb = AT Vn
A Yb AT Vn = A Is …(7.27) Fig. 7.48
Y Vn = I
where Y = A Yb AT
and I = A Is
The matrix Y is called admittance matrix. This is the KCL equation in matrix form.
In terms of f-cutset matrix, the KCL equation can be written as
Q Ib = 0
Q (Yb Vb – Vs) = 0
Q Yb Vb = Q Is
Also Vb = QT Vt
Q Yb QT Vt = Q Is …(7.28)
Y Vt = I
where Y = Q Yb QT
and I = Q Is
This is the KCL equation in matrix form.
(2) If there is a voltage source in series with an impedance and a current source in parallel with the
combination as shown in Fig. 7.49,
1
yk =
zk
ik = yk vk + yk vsk - isk …(7.29)
In matrix form,
Ib = Yb Vb + Yb Vs – Is …(7.30)
KCL equation will be given by,
A Ib = 0
A (Yb Ib + Yb Vs – Is) = 0 Fig. 7.49
A Yb Vb = A Is – A Yb Vs
Also Vb = AT Vn
T
A Yb A Vn = A Is – A Yb Vs …(7.31)
Y Vn = A Is – A Vb Vs
where Y = A Yb AT is the node admittance matrix. This is a generalised KCL equation.
In terms of f-cutset matrix, the KCL equation can be written as
Q Ib = 0
Q (Yb Vb + Yb Vs – Is) = 0
Q Yb Vb = Q Is – Q Yb Vs
Also Vb = QT Vt
T
Q Yb Q Vt = Q Is – Q Yb Vs
Y Vt = Q Is – Q Yb Vs …(7.32)
This is a generalised KCL equation.
 Example 7.14 For the network shown in Fig. 7.50, write down the tieset matrix and obtain the network
equilibrium equation in matrix form using KVL. Calculate the loop currents and branch currents.

Fig. 7.50
Solution The oriented graph and one of its trees are shown in Fig. 7.51.

Tieset1: {1, 4, 5}
Tieset2: {2, 4, 6}
Tieset3: {3, 5, 6}
 Fig. 7.51
Tieset Matrix
(B)
1 2 3 4 5 6
1 é1 0 0 1 1 0ù
B = 2 ê0
ê 1 0 –1 0 –1ú
ú
3 ë0 0 1 0 –1 1 û
The KVL equation in matrix form is given by
B Zb BT Il = B Vs – B Zb Is
Here, Is = 0,
T
B Zb B Il = B Vs
é1 0 0 0 0 0 ù é1 0 0 ù é 2ù
ê0 1 0 0 0 0 ú ê0 1 0 ú ê0ú
ê ú ê ú ê ú
0 0 1 0 0 0 0 0 1 ê 0ú
Z = ê ú B =ê
T V=
b ú s
ê0 0 0 2 0 0 ú ê1 –1 0 ú ê0ú
ê0 0 0 0 2 0 ú ê1 0 –1 ú ê0ú
ê ú ê ú ê
êë 0 0 0 0 0 êë 0 –1 1 êë 0 úû
2 úû úû
é1 0 0 0 0 0 ù
ê0 ú
0ú
é 1 0 0 1 1 0ù ê 1 0 0 0 é 1 0 0 2 2 0ù
B Z = ê 0 1 0 -1 0 0 1 0 0 0ú ê
-1 ú = 0 1 0 –2 0 –2ú
ê 0 0 0 2 0
b
ê ú ê0 0 0 0 2 0 ú ê ú
ë 0 0 1 0 -1 1 û 0 0 1 0 –2 2
0ú ë û
ê0
ê ú
êë 0 0 0 0 0 2 úû
 é1 0 0 ù
ê0 1 0 ú
é1 0 0 2 2 0ùê ú
ê ú ê 0 0 1 ú éê 5 –2 –2 ù
T
B Zb B = 0 1 0 –2 0 –2 = –2 5 –2 ú
ê ú ê1 –1 0 ê ú
ú ë –2 –2 5 û
ë0 0 1 0 –2 2 û ê
ê 1 0 –1 ú
ú
êë 0 –1 1
úû é 2 ù
ê0ú
é1 0 0 1 1 0ùê ú é2ù
B V = ê 0 1 0 -1 0 0
s
ê -1úú êê 0 úú =êê ú0 ú
-1 1û ê ú ë 0 û
ë0 0 1 0
ê0ú
êë 0
úû
The KVL equation in matrix form is given by
é 5 –2 –2ù éêIl1 úù é 2 ù
ê ú ê 0ú
–2 5 –2 ê I l2 ú ê ú
ê= ú
ë–2 –2 5û ê Il ë 0û
ú
ë3û
Solving this matrix equation, we get
6
I = A
l1
7
4
I = A
l2
7
4
I = A
l3
7
The branch currents are given by
Ib = BT Il
é i1 ù é 1 0 0 ù é6/7ù
êi ú ê ú ê ú
ê 2 ú ê 0 1 0 ú é 6 / 7 ù ê 4 / 7ú
i
ê ú= ê
3 0 0 1 úê4/7ú=ê 4 / 7 ú
êi4 ú ê1 –1 0 ú ê4 / 7 ú ê 2 / 7 ú
ê i ú ê1 0 –1 ú ë û ê2/7ú
ê 5ú ê ú ê ú
êë i6 úû êë 0 –1 1 ëê 0 úû
úû

Example 7.15 For the network shown in Fig. 7.52, write down the tieset matrix and obtain the network
equilibrium equation in matrix form using KVL. Calculate loop currents.
Fig. 7.52
Solution The oriented graph and its selected tree are shown in Fig. 7.53.

Tieset1: {1, 4, 6}
Tieset2: {2, 5, 6}
Tieset3: {3, 5, 4}
 Fig. 7.53

Tieset Matrix
(B)
1 2 3 4 5 6
1 é1 0 0 1 0 1 ù
B = 2 ê0 1 0 0 1 –1 ú
ê ú
3 ë0 0 1 –1 –1 0 û
The KVL equation in matrix form is given by
B Zb BT Il = B Vs – B Zb Is
Here, Is = 0,
B Zb BT Il = B Vs
é6 0 0 0 0 0ù é1 0 0 é 12 ù
ê0 4 0 0 0 0ú ê –6 ú
ê ú ù ê ú
ê0 1 0
ú
ê ú
-8
Z = ê
0 0 2 0 0 0ú T
B = ê 0 0 1 V = ê ú
b ú s
ê0
ê 0 00 00 40 06 0ú ê1 0 –1 ê 0ú
0ú ú ê 0
ê0 1 –1 ú
ê ú ê ú êú ú
êë 0 0 0 0 0 êë 1 –1 0 ëê 0 úû
2úû úû

é6 0 0 0 0 0ù
ê0 4 0 0 0 0 úú é 6 0 0 4
é1 0 0 1 0 1 ù ê 0 2ù
B Z = ê0 1 0 0 1 –1 ú 0 2 0 0 0 ú = ê0 4 0 0 6 –2ú
ê0 0 0 4 0
b 0 1 –1 ú ê0 0 0 0
ê 6 0ú ê ú
ë0 –1 0 û ê
0 0ú ë 0 0 2 –4 –6 0 û
ê 0 0 0 0 ú
êë 0 2 úû

é1 0 0ù
ê0 1 0ú
é6 0 0 4 0 2ùê ú é12 –2 –4ù
0 0 1ú ê
B Z BT = ê0 4 0 0 6 –2 ú ê = –2 12 –6ú
b
ê 0 2 –4 –6 ú ê1 0 –1 ú ê ú
ë0 0ûê
0 1 –1 ú ë –4 –6 12 û
ê ú
êë 1 –1 0 úû
7.30 Electrical Networks
 é12 ù
ê –6ú
é 1 0 0 1 0 1ù ê ú
–8 é12 ù Graph Theory 7.31
B Vs = 0 1 0 0 1 –1ú ê ú = ê –6 ú
ê
ê úê0 ê ú
ú ë –8û
ë0 0 1 –1 –1 0 û ê 0
ú ê ú
ëê 0 úû
Hence, the KVL equation in matrix form is given by
é12 –2 –4ù éêIl1 úù é12 ù
ê ú ê ú
–2 12 –6 ê Il2 ú = –6
ê –4 –6 12 ûúê Il ú
ë ëê –8ûú
ë3û
Solving this matrix equation, we get
Il1 = 0.55 A
Il2 = – 0.866 A
Il3 = – 0.916 A

Example 7.16 For the network shown in Fig. 7.54, write down the tieset matrix and obtain the network
equilibrium equation in matrix form using KVL.

Fig. 7.54

Solution The oriented graph and its selected tree are shown in Fig. 7.55.

Tieset 1: {1, 4, 6}
Tieset 2: {2, 5, 6}
Tieset 3: {3, 5, 4}

Fig. 7.55
Tieset Matrix (B)
1 2 3 4 5 6
1 é1 0 0 1 0 1ù
ê
B = 2 ê0 1 0 0 1 –1 ú
ú
3 ë0 0 1 –1 –1 0 û
The KVL equation in matrix form is given by
B Zb BT Il = B Vs – B Zb Is
é2 0 0 0 0 0ù é 0ù
ê0 2 0 0 0 0ú é1 0 0 é10ù
ê 0ú ê 0ú
ù
ê0 1 0
ú
ê ú ê0 0 1ú ê ú ê ú
Z = 0 0 5 0 0 T ê 0
ú ê 0ú B = V =ê ú I= ê –2 ú
ê0 0 0 5 0 0ú
b s s
ê0 0 0 ê1 0 –1 ê 0ú ê ê 0 ú
0 j5 0 ú 0ú ê 0ú
ú ê0 1
ú –1
ê ú ê ú ê ú ê ú
êë 0 0 0 0 0 – j4 êë –1 0 úû êë 0 úû ëê 0 úû
úû 1
0 0 0 0
é2 2 0 0 0 0 ù
ê 0 5 0 0 00 úú 0 – j4ù
é1 0 0 1 0 1 ù ê 00 êé 20 0 0 5
B Zb= ê 1 0 0 0 0 5 0 2 0 0 j5 j4 ú
1 –1 ú ê ú = ú
ê0 úê 0 0 0 j5 ê
0 ú ë0 0 5 –5 – j5 0û
0 0 0 0 0 0 ú
ë 0 0 1 –1 –1 0ûê
0 ê ú
êë 0 -j4 úû

é1 0 0 ù
ê0 1 0 ú
é2 0 0 5 0 – j4 ù ê ú é7 – j4 j4 –5 ù
T ê 0 0 1
B ZbB = 0 2 0 0 j5 ú ê
j4 ú ê1 0 –1 ú = êú ê j4 2 + j1 – j5 ú
ê ú
ë 0 0 5 –5 – j5 0ûê ú ë –5 – j5 10 + j5
0 1 –1 û
ê ú
êë 1 –1 0 úû

é10ù
ê 0ú
é 1 0 0 1 0 1ù ê ú
0 é10ù
B Vs = 0 1 0 0 1 –1ú ê ú = ê 0 ú
ê
ê ú ê 0ú ê ú
0 0 1 –1 –1 0 0
ë û ê0 ú ë û
ê ú
êë
0 úû

é 0ù
ê ú
é2 0 0 5 0 – j4 ù ê 0–2ú é 0 ù
B Zb Is = ê 0 2 0 0 j5 j4 ú ê ú = ê 0 ú
ê úê ê ú
0ú ë –10û
ë 0 0 5 –5 – j5 0û ê
0ú ê ú
ëê 0 úû
Hence, the KCL equation in matrix form is given by
B Zb BT Il = B Vs – B Zb Is
 é7 - j 4 j4 -5 ù é I l ù
é10ù é 0 ù é10ù
ê + -
ú êI ú
1
ê 0 ú - ê 0 ú = ê 0ú
j4 2 j1 j5 ê l2 ú ê ú ê ú ê ú
êë -5 - j5 10 + j5ûú ê Il = ë 0 û ë -10 û ë10 û
ú
ë3û

Example 7.17 For the network shown in Fig. 7.56, write down the tieset matrix and obtain the network
equilibrium equation in matrix form using KVL.

Fig. 7.56
Solution The branch currents are so chosen
that they assume the direction out of the
dotted terminals. Because of this choice of Links: {1, 3}
current direction, the mutual inductance is Tieset 1: {1, 2}
positive. The oriented graph and its selected Tieset 3: {3, 2}
tree are shown in Fig. 7.57.
Tieset Matrix (B)
1 2 3
é 1 1 0ù Fig. 7.57
B = ê ú
ë 0 –1 1 û
The KVL equation in matrix form is given by
B Zb BT Il = B Vs – B Zb Is
Here Is = 0,
B Zb BT Il = B Vs
é j5 0 j5.66 ù é1 0ù é50Ð0°ù
Zb = ê 0 0 ú B = ê 1 –1ú Vs = ê 0 ú
T
3 - j4
ê ú ê ú ê ú
ë j5.66 0 5 + j10 0 1 0
é j5 0û j5.66 ù ë û ë û
BZ = é1 1 0ù j5.66 ù
0 3 - j4 0 ú é j5 3-
= j4
ê
b ê 0 –1 1ú ê ú êë
ë û -3 + j4 5 + j10 úû
ë j5.66 0 5 + j10 û
é é 1 0 ù j5.66
T j5.66 ù ê -3 + j9.66 ù
BZ B = j5 3- 3 + j1
j4 é = 1 –1ú =
b ê -3 + j4 5 + ê ú ê -3 + j9.66 8 + j6 ú
ë ë û
ú
j10 û ë 0 1 û
j5.66
é50Ð0°ù
BV = é1 1 0ù ê ú é50Ð0°ù
s ê 0
ë –1 1úû ê 0 ú êë 0 úû
ë 0 û
Hence, the KVL equation in matrix form is given by
é 3 + j1 -3 + j9.66ù é Il ù é50Ð0°ù
1 =
 ê -3 + j9.66 8 +
j6ë ú êI ê
ë 0
ú
û
úû
ë l2 û

Example 7.18 For the network shown in Fig. 7.58, write down the tieset matrix and obtain network
equilibrium equation in matrix form using KVL.

Fig. 7.58
Solution The branch currents are so chosen
that they assume the direction out of the
dotted terminals. Because of this choice of
current direction, the mutual inductance is
Links: {1, 3}
positive. The oriented graph and its selected Tieset 1: {1, 2}
tree are shown in Fig. 7.59. Tieset 3: {3, 2}
Tieset Matrix (B)
1 2 3
é1 1 0ù
B= ê ú
Fig. 7.59
ë 0 –1 1 û
The KVL equation in matrix form is given by
B Zb BT Il = B Vs – B Zb Is
Here Is = 0,
B Zb BT Il = B Vs
é3 + j4 j3 0 ù é 1 0ù é50Ð45°ù
Zb = ê j3 j5 0 ú B = ê 1 –1ú Vs = ê 0 ú
T
ê ú ê ú ê ú
0 0 – j8 0 1 ë 0 û
ë û j3 0 ù ë û
é3 + j4
B Z = é 1 1 0ù
ê j3 j5 0 ú é3 + j8 0 ù
j7 =
b ê 0 –1 1ú ê ú ëê – j3 – j5 – j8 úû
ë û
ë 0 0 – j8û
é 1 0ù
T
B Z B = é3 + j7 j8 0 ùê é3 + j15 – j8 ù
ú 1 –1ú =
b ê – j3 – j5 – j8 ê ú ê ú
ë û ë – j8 – j3 û
ë 0 1 û
é50Ð45°ù
B V = é 1 1 0ù é50Ð45°ù
s ê 0 –1 1ú ê ê 0 úú ê 0 ú
ë û ë û
ë 0 û
Hence the KVL equation in matrix form is given by,
é3 + j15 – j8ù é Il ù 50Ð45°ù
ê ú ê 1 ú =éê
ë – j8 – j3 û I 0 ú
ë l3 û ë û
Example 7.19 For the network shown in Fig. 7.60 ,obtain equilibrium equation on node basis.
 Fig. 7.60
Solution The oriented graph and one tree
are shown in Fig. 7.61.
1 2 3 4
1é 1 –1 0 0ù
Q= ê
3 ë 0 –1 1 1úû
The KCL equation in matrix form is given by Fig. 7.61
Q Yb QT Vt = Q Is – Q Yb Vs
Here, Vs = 0
QYb QT Vt = QIs
Current entering into the node is taken as negative.
é 5 0 0 0ù é 1 0ù é –10ù
ê0 5 0 0ú ê –1 –1ú ê ú
Yb = ê0 0 5 0 ú T
Q = ê 0 ú Is = ê 0 ú
ê ú ê 1ú ê 0ú
êë 0 0 0 10úû ëê 0 ëê 0úû

1úû
é 5 0 0 0ù
é 1 –1 0 0 ù ê0 5 0 0 ú é5 –5 0 0ù
QYb = ê ú ê ú= ê 0 –5 5 10 ú
ë 0 –1 1 1 êû 0 0 5 0 ú ë û
êë 0 0 0 10úû
é 1 0ù
T ú é 5 –5 0 0 ù ê –1 – é10 5ù
1
= ê ú ê ú = ê
QYb Q ë 0 –5 5 10 û 0 1 ë 5 20 û
ê ú
ëê 0 1úû
é –10ù
é 1 –1 0 0 ù ê ê 0 úú = é –10ù
QIs = êë 0 –1 1 1úû 0 ëê 0 úû
ê ú
ëê 0úû
Hence, KCL equation will be written as
é10 5ù êé v1túù = é–10ù
ê ú ê ú
5 20 v ë 0 û
ë û ë 3û
t
Solving this matrix equation, we get
 vt1 8
=– V
7
2
= V
vt3 7

Example 7.20 Calculate the twig voltages using KCL equation for the network shown in Fig. 7.62.

Fig. 7.62
Solution The oriented graph and one of
the trees are shown in Fig. 7.63.
f-cutset 1: {1, 4, 5, 6}
f-cutset 2: {2, 4, 5}
f-cutset 3: {3, 4, 6} f-cutset 1: {1, 4, 5, 6}
f-cutset 2: {2, 4, 5}
1 2 3 4 5 6 f-cutset 3: {3, 4, 6}
1é1 0 0 –1 –1 1ù
ê 0 –1 –1 0 ú
Q = 2ê 0 1 ú
3 ë0 0 1 –1 0 1û
The network equilibrium equation on Fig. 7.63
node basis can be written as
QYb QT Vt = QIs – QYb Vs
é0.2 0 0 0 0 0ù é0 ù é910 ù
ê 0 0.2 0 0 0 0ú ê0 ú ê 0ú
ê ú ê ú ê ú
0 0 0.2 0 0 0ú ê 0ú ê 0ú
Yb = ê Is = Vs =ê 0ú
ê 0 0 0 0.1 0 0ú ê0 ú
ê 0
ê
0 0 0 0.5 0 úú ê0 ú
êú
ê 0ú
ê ú
êë 0 0 0 0 0 . êë 0 ëê 0 úû
0 úû
1ú
é0.2 0 0 0 0 0ù
ê 0 0.2 0 0 0 0ú
é 1 0 0 –1 –1 1ù ê 0 ú
ê úê 0 0.2 0 0 0ú
QYb = 0 1 0 –1 –1 0
ê 0 0 1 –1 0 1ú ê 0 0 0 0.1 0 0ú
ë ûê 0 0 0 0 0.5 0ú
ê ú
êë 0 0 0 0 0 0.1úû
 é 1 0 0ù
ê 0 1 0ú
é0.2 0 0 –0.1 –0.5 0.1ù ê 0 0 1ú é0.9 0.6 0.2ù
QYb QT = ê 0 0.2 0 –0.1 –0.5 0ú ê ú = ê0.6 0.8 0.1ú
ê ú ê –1 –1 –1ú ê ú
ë 0 0 0.2 –0.1 0 0.1 û êê –1 –1 0 ú 0.2 0.1 0.3
ú ë û
 ê 1 0 1úû
ë
é0ù
ê0ú
é 1 0 0 –1 –1 1ù ê ú
0 é0ù
QIs = ê0 1 0 –1 –1 0 ú ê ú = ê 0 ú
ê ú ê0ú ê ú
0
ë 0 0 1 –1 0 1û ê0ú ë û
êú
êë 0 úû
é910ù
ê ú
é0.2 0 0 –0.1 –0.5 0.1ù ê 0 ú é182ù
QY V = ê 0 0.2 0 –0.1 –0.5 0ú 0ú ê ú
= 0
ê
b s
ê ú ê 0ú ê ú
ë 0 0 0.2 –0.1 0 0.1û ê ú ë 0û
ê 0ú
ëê 0úû
é –182ù
QIs – QYbVs = ê 0 ú
ê ú
ë 0 û
Hence, KCL equation can be written as,
QYb QT Vt = QIs – QYb Vs
é0.9 0.6 0.2ù éêvt1ùú é –182ù
ê ú ê ú
0.6 0.8 0.1 êvt2 ú = 0
êë0.2 0.1 0.3ûú êvt ú ëê 0 ûú
ë3û
Solving this matrix equation, we get
vt1 = – 460 V
vt2 = 320 V
vt3 = 200 V

Example 7.21 For the network shown in Fig. 7.64, write down the f-cutset matrix and obtain the network
equilibrium equation in matrix form using KCL and calculate v.

Fig. 7.64
Solution The oriented graph and
its selected tree are shown in Fig.
7.65. Since voltage v is to be
determined, branch 2 is chosen as Twigs: {2, 4}
twig. f-cutset 2: {2, 1, 3}
f-cutset 3: {4, 3}

1 2 3 4
é –1 1 1 0ù
Q = ê 0 0 –1 Fig. 7.65
ë ú
1 û
The KCL equation in matrix form is given by
Q Yb QT Vt = Q Is – Q Yb Vs
é0.5 0ù é –1 0ù é 0ù é2ù
0 0
ê 0 0.5 0 0 ê 1 0ú ê 0ú ê0ú
T
ú
Yb = ê 0 0.5 0ú Q = ê 1 –1ú Is = ê Vs = ê ú
0 ú 0 0
ê ú ê ú ê ú ê ú
ëê 0 0 0 ëê 0 êë –2v êë 0 úû
0.5úû úû
1úû
é0.5 0 0 0ù
é -1 1 1 0 ù ê 0 0.5 0
0 ú é -0.5 0.5 0.5 0ù
QYb = ê -1 ú 0ú = ë 0.5 úû
ê 1û ê 0 0 -0.5
ë 0 0 0 0.5
0 ê ú
ëê 0 0 0 0.5úû
é -1 0 ù
T é -0.5 0.5 0.5 0ù ê ê 1 0 úú = êé 1.5 -0.5 úù
QYb = ê 1 -1 ë -0.5 1û
Q ë 0 0 –0.5 0.5 úû
ê ú
ëê 0 1úû
é 0ù
é –1 1 1 0 ù êê 0úú é 0 ù
QIs = ê 0 0 –1 1úû 0 = êë –2v úû
ë ê ú
êë –2v úû
é 2ù
é –0.5 0.5 0.5 0ù ê é –1ù
0ú
ê êú ú = ú
QYb Vs = ê 0 0 –0.5 0.5 úû 0 0 û
ë
ê
ë
êë 0úû
é1 ù
QIs – QYbVs = ê
–2v úû
Hence, the KCL ëequation can be written as
QYb QT Vt = QIs – QYb Vs
é 1.5 –0.5ù év t 2ù é 1ù
ê úê ú = ê ú
ë –0.5 1 v
û ë t4 –2v
ë û
û
From the figure, vt = v
2
Solving this matrix equation, we get
vt2 = 0.44 V
vt = 0.66 V
4
 v = v t = 0.44 V
2

Example 7.22 For the network shown in Fig. 7.66, write down the f-cutset matrix and obtain the network
equilibrium equation in matrix form using KCL and calculate v.
Fig. 7.66

Solution The voltage and current sources are converted into accompanied sources by source-shifting
method.
Fig. 7.67
The oriented graph and its selected tree
are shown in Fig. 7.68.
1 2 3 4 Twigs: {1, 2}
é 1 0 0 –1ù
Q= f-cutset 1: {1, 4}
ê 0 1 –1 f-cutset 2: {2, 3}
ë

0 úû
The KCL equation in the matrix form is
given by
QYb QTVt = QIs – QYbVs
é0.25 0 0 0ù
ê 0 0.5 0 0ú Fig. 7.68
Yb = ê 0 0 0.25 0ú
ê ú
ë ê 0 0 0 0.5ú û
é1 0ù é
ê0 0ù é 1ù
1ú ê
T
0ú ê 1ú
Q = ê 0 –1ú Is = ê 0.5 ú Vs = ê ú
ê ú ê ú ê0 ú
êë 1 0 ú û êë – êë 0 úû
0.5úû
 é0.25 0 0 0 ù
QYb = êé01 01 –1 1 êê 0 ú = é0.25 0 –0.5
0 0 ùú 0 0.5
0 0.25 00
0
ê 0 0
0.5 –0.25 0 úù
ë – ûê ú ë û
êë 0 0 0 0.5úû
é 1 0ù
T é0.25 0 0 –0.5ù ê0 1ú é0.75 0 ù
QYb Q ê ú=
= 0 0.5 –0.25 0 úûê 0 –1ú 0 0.75 úû
ê ê 10ú
ë ë û
ê
ë é 0 ù
é 1 0 0 –1ù ê 0 ú é 0.5ù
QIs = ê 0 1 –1 0 ú ê 0.5 ú = –0.5
ë û êë û
ê ú
êë –0.5úû
é 1ù
é0.25 0 0 –0.5ù ê 1ú é0.25ù
QYb Vs = ê 0 0.5 –0.25 ê ú= ê
ë 0 úûê ú0 ë 0.5 û
ú
êë 0úû

QIs – QYbVs = é0.25ù

ê –1
ë
ú
û
Hence, the KCL equation can be written as
QYb QT Vt = QIs – QYb Vs
é0.75 0 év é0.25ù
ù t
ù ê 1ú =
ê ú ê ú
ë 0 0.75 v
û ë t2 û ë –1 û
Solving this matrix equation, we get
v t1 = 0.33 V
v t2 = –1.33 V
From the figure, v = 1 + v t = – 0.33 V
2

7.13 DUALITY
Two networks are said to be the dual of each other when the mesh equations of one network are the same as
the node equations of the other. Kirchhoff’s voltage law and current law are same, word for word, with
voltage substituted for current, independent loop for independent node pair, etc. Similarly, two graphs are
said to be the dual of each other if the incidence matrix of any one of them is equal to the circuit matrix of
the other. Only planar networks have duals.

Table 7.1 Conversion for Dual Electrical Circuits

Loop basis Node basis
Current Voltage
Resistance Conductance
Inductance Capacitance
Branch current Branch voltage
Mesh Node
Short circuit Open circuit
Parallel path Series path
7.40 Electrical Networks

The following steps are involved in constructing the dual of a network:

(1) Place a node inside each mesh of the given network. These internal nodes correspond to the
independent nodes in the dual network.
(2) Place a node outside the given network. The external node corresponds to the datum node in the
dual network.
(3) Connect all internal nodes in the adjacent mesh by dashed lines crossing the common branches.
Elements which are the duals of the common branches will form the branches connecting the
corresponding independent node in the dual network.
(4) Connect all internal nodes to the external node by dashed lines corresponding to all external
branches. Duals of these external branches will form the branches connecting independent nodes
and the datum node.
(5) A clockwise current in a mesh corresponds to a positive polarity (with respect to the datum node) at
the dual independent node.
(6) A voltage rise in the direction of a clockwise mesh current corresponds to a current flowing towards
the dual independent node.

Example 7.23 Draw the dual of the network shown in Fig. 7.69.

Fig. 7.69
Solution
(a) Place a node inside each mesh.
(b) Place a node outside the mesh which will correspond to the datum node.
(c) Connect two internal nodes through a dashed line. The element which is dual of the common branch
(here capacitance) will form the branch connecting the corresponding independent node in the dual
network.
(d) Connect all internal nodes to the external node by dashed lines crossing all the branches. The dual
of these branches will form the branches connecting the independent node and datum.

Fig. 7.70
 Graph Theory 7.41

Dual network

Fig. 7.71

Example 7.24 Draw the dual of the network of Fig. 7.72.

Fig. 7.72

Solution For drawing the dual network, proceed in the same way as in Example 7.23.

Fig. 7.73

Fig. 7.74
7.42 Electrical Networks

Example 7.25 Draw the dual of the network shown in Fig. 7.75.

Fig. 7.75

Solution For drawing the dual network, proceed in the same way as in Example 7.23.

Fig. 7.76

Fig. 7.77
 Graph Theory 7.43

Exercises
1. For the networks shown, write the incidence matrix, tieset matrix and f-cutset matrix.
(i)

Fig. 7.78
(ii)

Fig. 7.79
(iii)

Fig. 7.80
(iv)

Fig. 7.81

2. For the graph shown, write the incidence

matrix, tieset matrix and f-cutset matrix.

Fig. 7.82
7.44 Electrical Networks

3. The incidence matrix is given as follows:

Branches →
1 2 3 4 5 6 7 8
-1 -1 0 0 0 0 1 0
0 1 1 0 1 0 0 0
0 0 -1 -1 0 1 0 0
1 0 0 1 0 0 0 1
Draw oriented graph and write tieset matrix.
4. The incidence matrix is given below:
Branches →
1 2 3 4 5 6 7 8 9 10
0 0 1 1 1 1 0 1 0 0
0 –1 –1 0 0 0 –1 0 0 –1
A = –1 1 0 0 0 0 0 –1 –1 1
1 0 0 0 –1 –1 1 0 0 0
Draw the oriented graph.
5. For the network shown in Fig. 7.83, draw the oriented graph and obtain the tieset matrix. Use this
matrix to calculate the current.

Fig. 7.83
6. Draw the dual networks for the circuits shown:
(i)

Fig. 7.84
(ii)

Fig. 7.85
 Graph Theory 7.45

(iii)

Fig. 7.86

(iv)

Fig. 7.87

(v)

Fig. 7.88

7. Using the principles of network topology, write the loop/node equation in matrix form for the network
shown in Fig. 7.89.

Fig. 7.89
7.4 Electrical Networks

Objective-Type Questions
1. The number of independent loops for a network with n nodes and b branches is
(a) n – 1 (b) b – n
(c) b – n + 1 (d) independent of the number of nodes
2. A network has 7 nodes and 5 independent loops. The number of branched in the network is
(a) 13 (b) 12 (c) 11 (d) 10

3. Identify which of the following is NOT a tree

of the graph shown in Fig. 7.90.
(a) begh (b) defg
(c) adfg (d) aegh

Fig. 7.90

4. The minimum number of equations required to

analyze the circuit shown in Fig. 7.91 is
(a) 3 (b) 4
(c) 6 (d) 7
 Fig. 7.91

5. Consider the network graph shown in Fig. 7.92.

Graph Theory 7.47

Fig. 7.92

Which one of the following is NOT a tree of this graph?

(a) (b) (c) (d)

6. Figure below shows a network and its graph is drawn aside. A proper tree chosen for analysing the
network will contain the edges.
(a) ab, bc, ad (b) ab, bc, ca (c) ab, bd, cd (d) ac, bd, ad

Fig. 7.93

7. The graph of an electrical network has n nodes and b branches. The number of links with respect to
the choice of a tree is given by
(a) b – n + 1 (b) b + n (c) n – b + 1 (d) n – 2b – 1
 8. In the graph shown in Fig. 7.94, one possible
tree is formed by the branches 4, 5, 6, 7. Then
one possible fundamental cut set is
(a) 1, 2, 3, 8 (b) 1, 2, 5, 6
(c) 1, 5, 6, 8 (d) 1, 2, 3, 7, 8
Fig. 7.94

9. Which one of the following represents the total

number of trees in the graph given in Fig. 7.95?
(a) 4 (b) C
(c) 5 (d) 8 Fig. 7.95

10. Which one of the following is a cutset of the

graph shown in the Fig. 7.96?
(a) 1, 2, 3 and 4 (b) 2, 3, 4 and 6
(c) 1, 4, 5 and 6 (d) 1, 2, 4 and 5

Fig. 7.96