Elements of Graph Theory

and Network Applications

6.1. INTRODUCTION
The mesh and the node methods of network
methods work well for relatively
analysis have been discussed in Chapter 5. These
simple cases. In complicated situations, the analysis is facilitated
by taking recourse to incidence, tie-set and cut-set matrices obtained on the basis of graph theory
which is a branch of topology.
The analysis employing these matrices will be outlined here.
6.2. AFEW IMPORTANT TERMS
In Sec. 5.1 we
have introduced some terms related to the graph of a network. A few more useful
concepts and terms will now be considered.
The graph
of the network of Fig. 6.1 (a) is shown in
Fig. 6.1 (b). It has four nodes marked
through 4 and six branches marked (1) through (6). In this graph the branches are not oriented
or directed ; this is an undirected
graph. Each branch of a graph may be given an orientation
or a direction with the aid of an
arrow head which
represents the assigned reference direction
for current. The graph is then referred to as a directed or an oriented
of the network of Fig. 6.1 (a) is shown in
graph. The directed graph
Fig. 6.1 (c).
(4) 4
w

2 3 4
(2) (5) (2) (5) (2) (5)
6) (1) 3/ (6) (1) (6)

(a) (b) (c)

Fig. 6.1. (a) A network; (b) associated undirected graph; («) associated directed
graph.
The rank of a graph is (n 1), where n is the number of nodes of the graph. The rank of
-

the graph of the network in Fig. 6.1 (a) is 3. The rank

rank of a graph, i.e., (n -
of a tree of a graph is the same as the
1). The branches which meet at a node are said to be incident at the

node. In Fig. 6.1, branches (2), (3), and (5) are incident at node 3.
6.3. INCIDENCE MATRIX
A graph is completely defined by specifying which branches are incident at which nodes
and with what orientations. This information is given in a matrix form, referred to as the incidence
matrix. The complete incidence matris, denoted by [A,l. of graph having n number of nodes and b

108
 Elements of Graph Theory and Network Applications 109

matrix. The complete incidence matrix, denoted by [A,]. of a graph havingn number of nodes and
b number of branches is a rectangular matrix of order n xb. The elements a, of this matrix have
the following values
a 1, if branch (j) is incident at node i and is oriented away from node i,
= - 1, if branch ( ) is incident at node i and is oriented towards node i,

= 0, if branch (G) is not incident at node i.

The complete incidence matrix [A] of the graph of Fig. 6.1 (c) is shown below

Nodes Branches

(2) (3) (4) (5) (6)

1 1 0
2 LA,) = - 1 1 0 1 0 0
3 1 0 0
4 0 0 0
In [A], the entries 1 and 1 for a particular branch occur in pair and the other entries for that
branch are zero. Consequently the sum of the elements in a column of [A] is zero, indicating that
one row of [A,] is the negative sum of all the other rows and can, therefore, be eliminated. The
rank of [Al is thus (n -1).
The matrix obtained from [A,] upon elimination of one of its rows is of order (n - 1) x b. It
is called the reduced incidence matrix, or simply the incidence matrix and is denoted by [A]. Iff
the incidence matrix is given, the oriented graph can be at once constructed [see worked-out
problem 1.
Let the transpose of the reduced incidence matrix [A] be [A]'. Then, it can be shown that the
number ofpossible trees of a graph will be det {[A] [A]'}. As an example, the matrix [A] for the
graph of Fig. 6.1 (c) obtained by eliminating the last row of [A) is
0 -1 0 0
[A]=-1 10 1 0
0 -1 1 0 1 0
So that

-10
0 1 -1
-10
[A =
0 1

-1
Therefore, the number of all possible trees of the graph of Fig. 6.1 (c) is

01
1 0 -1 0 0 -1||
|-1 0
det -1 101 0 0 1 0
0 -1 1 0 1 0|| 0
 110 Fundamentals of Electric Circuit Theory

3 -I -11
= det-1 3 -1 =3x8+1x(-4)-1x4 = 16.
-1 -1 3
6.4. TIE-SET MATRIX
Let us choose a tree of a graph. The links placed one at a time, form loops which are called
fundamental circuits or fcircuits. A set of branches forming a loop is called a tie-set. The
orientation of the link coincides with the chosen direction of the associated loop current, i.e., the
fcircuit current. If b is the number of branches and n is the number of nodes in a graph, the
number of f-circuits will be equal to the number of links, i.e., b, = b -n + 1.
The tie-set matrix [B] is a rectangular matrix having b number of columns and b, number
ofrows. Its elements b, have the following values;
b 1, if branch () is in loop j and their orientations are the same
- 1 , if branch (i) is in loop j and orientations differ.
0, if branch (G) is not in loop j. (4)
Let the chosen tree of the graph of Fig. 6.1 (c) be as shown
in Fig. 6.2, the twigs being shown by solid lines. Here b = 66 2e
and n = 4, so that the number of links, shown by dashed lines,
is b, = 6 -4 + l =3. The current orientations of the fcircuits
are shown by curved arrows in Fig. 6.2. The f-circuits are
numbered according to the associated links. Thus, the f-circuit 6)
formed by link (1) in Fig. 6.2 is designated fcircuit 1: The
branches constituting f-circuit 1, taken in sequence with the
link first, are (1), (2), and (3). We write Fig. 6.2. Tree and f-circuits
Scircuit 1 : [1, 2, 3] of the graph of Fig. 6.1 (c).

Similarly, we write for the other f-circuits of Fig. 6.2

fcircuit 5: [5, 2, 4]
fcircuit 6: [6, 2, 3, 4]
The tie-set matrix [B] of the graph of Fig. 6.2 is shown below.

f-circuits Branches

(1) (2) (3) (4) (5) (6)

1 0 0
5 [B] = 0 0 - 1
1 0
6 - 1 1 0
The tie-set matrix (B] facilitates the determination of the branch current from the loop
current. If (i,] is the branch current matrix, {l] is the loop current matrix, and [B is the
transpose of the matrix [B], then
..(6.1)
For example, let us denote the currents in branches I through 6 in Fig. 6.2 by i, through is
respectively. Then [i,) is a column matrix [i, i, ig i is i . The loop current matrix } is a
column matrix [, I, l)'. From Eq. (6.1) we write
 111
Elements of Graph Theory and Network Applications

1 0 0]

1 0 -1
4
s o 10
0

which gives
-Is + l is ls, and i, =ls =

i i h +l - , i =1 - i= can also be written using

the tie-set
Kirchhoff's voltage law (KVL) equations for a network
KVL equation for a loop is Ev 0, the =

matrix. If V is the voltage drop across branch k, then

the number of loops orf-circuits,
summation being taken over all the branches of the loop. If b, is
then there will be b, number of KVL equations, one for
each loop. The KVL equation for f-circuit
i can be written as

b
byv, =0 (i=1, 2, , b)
jl
where b the elements of the tie-set matrix [B], b being the
are
Fig. 6.3. Branch having a
number of branches. The set of b, KVL equations can be written voltage source.
in matrix form
B]v] = 0 ..6.2)
where
in branchj having impedance Z, and carrying current i, (see
If there is a voltage source v,
Fig. 6.3), then
1 , 2, .., b)
In matrix form

Z 0 0 [i1|
V2 0 Z2 0

V
mutual coupling between the branches, as may be
The Z-matrix is diagonal. If there is
this matrix is no longer diagonal and we write
brought about by mutual inductances,
Z1 Z12 Z Vs
Z21 Z2 .Z2b

... Zpb
or, in compact form
.6.3)
and (6.3), obtain
Using Eqs. (6.2) we

B] v,] = 0 = [B] [Z,] li,l - [B] I»,]

112 Fundamentals of Electric Circuit Theory

Substituting for i, from Eq. (6.1) we have

B1 = B] (Z,] [B]"'l . .6.4)
which is the KVL equation in matrix form and represents a set of b, number of mesh or loop
equations. The equations can be solved for the loop currents. The matrix [Z] = [B] [Z,] [B
is ealled the loop-impedance matrix. For a passive reciprocal network, [Z, is a symmetrical
matrix.

6.5. CUTSET MATRIX

(4)
Consider a tree of a graph and draw a set of closed surfaces
each of which cuts only one twig and a minimum number of
links. Such a set of closed surfaces is
called a cutset. The 6
number of such closed surfaces, known as cuts, is (2) (5)
evidently
equal to the number of twigs, i.e., (n -1), wheren is the
(3)
number of nodes. (1)
In Fig. 6.4 we show a tree of the graph of Fig. 6.1 (c), the
twigs being shown as solid lines. The number of twigs here is
3, which is equal to the number of cuts. The cuts, shown
by
dotted lines, are denoted by C C2, and Fig. 6.4. Tree and f-cutsets.
Cg respectively; they
cut the twigs (1), (2), and (6), respectively, and a minimum number of links.
The twig and the links which a cut removes or cuts are said to constitute a fundamental
cutset or f-cutset. The cut C, cuts the twig (1) and the links (shown by dashed lines) (3), (5) and
(4). The cut C, cuts the twig (2) and the links (5) and (3); the cut C the twig (6) and the links
(5) and (4). The orientation of af-cutset is taken to be the same as that of the twig defining the
f-cutset. VWith the twig as the first entry, the f-cutsets of Fig. 6.4 are written as
f-cutset 1 : [1, 3, 4, 5
fcutset 2 : [2, 3, 5]
f-cutset 6: [6, 4, 5]
The f-cutset matrix [Q] is a rectangular matrix having b number of columns and (n -

1)
number of rows. Its elements 9 are defined as follows
1 , if branch G) is in f-cutset i and the orientation of branch (j)coincides
with the orientation of f-cutsett i.
1, if branch (j) is in f-cutset i and the orientation of branch
= -

coincide with that of f-cutset i.

() does not
=
0, if branch G) is not in fcutset i.
The f-cutset matrix [Q) of the graph of Fig. 6.4 is
f-circuits Branches

() (2) (3) (4) (5) (6)

- 1
- 1
2 1Q1 = - 1
0
6 LO 0

For the f-cutset 1, the entry in [Q1 for the twig (1) in Fig. 6.4 is
+1, since the orientation
of the f-cutset 1 coincides with the orientation of twig 1. The for
entry branch (3) is 1 as the -

orientation of branch (3) is opposite to that of the fcutset 1, i.e., twig (1): branch (3) goes into
Elements of Graph Theory and Network Applications 113

the surface C while twig (1) goes out of the surface C. Similarly, the other entries in 1Q] can be
explained.

The cutset matrix [Q] allows us to determine the branch voltages from the twig voltages. If

v is the branch voltage matrix. [V,] is the twig voltage matrix, and 1Q1 is the transpose of
the f-cutset matrix [Q]. then
.(6.5)
For the tree of Fig. 6.4, Eq. (6.5) can be written as

0 0
V
0 0
-1 -1 0

V'4 -1 0 -1
V
-1 -1-1
0
This gives
V= Vi. V2 = V2, V'z = - V, - V2» V, = - V, - V, Vs = - V - Vs - Vs» and v, = V

Kirchhoff's current law (KCL) equations can be written using the cutset matrix [Q1. If i, is
the current in branch k, then the KCL equation for a node is Ei, = 0; the summation is taken
over all the branches incident at the node. Taking one node as the reference or the datum node,
there are (n - 1) number of KCL equations, one for each of the other nodes.

The KCL equations can be written in the matrix form

.(6.6)
where [i,] is a column matrix of branch currents -

If the branch (j) contains an input current source i and an

admittance y, (Fig. 6.5). then

yij = 1, 2, .. b
where v, is the branch voltage.
Fig. 6.5. Branch with input
In matrix form
current source.
li,) = va] v , ] - i,]
(6.7)
where the matrix ly,] may be diagonal when there is no mutual inductance; otherwise it is not
diagonal.
Using Eqs. (6.6) and (6.7) we get
1Q1 lil = 0 = Q1 y,l y,l - lQ1 1

and from Eq. (6.5) we have

...(6.8)
This isthe KCL equation in matrix form and represents a set of (n - ) number of node pair
equations. These equations can be solved for the tree branch voltages. The matrix y] [Qly,l =

Q1is called the node-pair-admittance matrix. For a passive reciprocal network, [y,] is symmetrical.
Note. The KCL equations can also be wrilten in terms of the reduced incidence
matrix [A
With one node as the reference, the branch
voltage matrix [v,] can be written in terms of the
node voltage matrix [V,] as
l = 1A]' IV,
..6.9)
114 Fundamentals of Electric Circuit Theory

The KCL equations can be written as

[A] Li,] = 0
6.10)
Combining Eqs. (6.10), (6.7) and (6.9) we get

=
[A] y»l [A]" [V,] 6.11)
which may be solved for the node voltages. The matrix
b) = [A] b,) [A]"
is called the node-admitiance matrix. For a passive reciprocal network, the matrix y,] is symmetrical
Equation (6.11) represents a set of (n - 1) number of equations, called the node equations.

6.6. GENERALISED NETWORK EQUATIONS

We considered above the KCL or the KVL equations when either the current sources or the
voltage sources are present. We shall now consider the generalised KVL and KCL equations
when both the current and voltage sources work as inputs.
A voltage source is said to be accompanied when there is a passive branch in series with
it. A current source is said to be accompanied when there is a passive branch in shunt with it.
In Fig. 6.6 (a) the voltage source v, and the current source i, are not accompanied. To make the
treatment general, the unaccompanied sources are converted into accompaniced sources, as shown
in Fig. 6.6 (b). In fact, such conversions are always possible and we shall develop the network
equations here treating all independent sources as accompanied sources.
R R4
- M-

R Ra R R2
-

(a) (b)
Fig. 6.6. (a) A network with unaccompanied sources, (6) conversion of the unaccompanied
sources into accompanied ones.

with a passive element and a current source

A general branch having a voltage source in series
In
in parallel with the combination is shown in Fig. 6.7.
this figure we have for the branch current

or, v Z i, + Z, i-Vi 6.12)

Therefore, the branch voltage matrix is
) = [Z,] li,] - »,]+ [Z,1 li,]

or B] v]=0 =[B] |Z,1 li,l-[B] [»]+(B] (Z,] Fig. 6.7. A general branch.

where Eq. (6.2) has been used. Also using Eq. (6.1) we have
B] (Z,] [B1 ] = [B] [v,]- [B] [Z,] liJ
(6.131
or Z =
[B] »] -[B] (Z,) i,]
Elements of Graph Theory and Network Applications 115
KVL
where [Z,= [B] [Z,) [B]' is the loop-impedance matrix. Equation (6.13) is the generalised
equation.
Writing y, = 1/Z, we obtain from Eq. (6.12)

Therefore the branch current matrix is

..6.14)
or using Eq. (6.6) we have
Q l l ) = 0 = [Ql v,l v,) + [Q] v,l v,) - 1Q1 l i

Also using Eq. (6.5) we get

have for the generalised KCL

Since y] [Q1 v,] [Q", the
=
node-pair admittance matrix, we

equation for the twig voltages

...(6.15)
The KCL equations can also be written in terms of the incidence matrix. Using Egs. (6.14),
(6.7) and (6.9) we have
A] D,l LA IV,] = [A] li,] - [A] D,)
or [ V , = A] li] - {A] v»l »] ..(6.16)
where y,l = [A] V,] [A1' is the node-admittance matrix. This is the generalised KCL equations
giving the node voltages.

6.7. wORKED-OUT PROBLEMS

1. The reduced incidence matrix of an oriented graph is
0 -1 1 1 0
[A]=0 0 -1-1 -1
-1 0 0 0 1
Draw the graph.
Ans. The graph has 3+1 =4 nodes and 5 branches. The complete incidence matrix is then:

Nodes Branches

(1) (2) 3) (4) (5)

1 0 - 1 1 1 0
2 [A,] = 0 1 1 1

3 - 1 0
4 +1 +1 0 0 0

First draw the 4 nodes (Fig. 6.8). Consider branch (1). It is obvious
from the complete incidence matrix that this branch leaves from node
4 and ends at node 3. Hence connect nodes 4 and 3 by a line with the (1) 5)
arrowhead pointing towards node 3, and call it branch (1) [Fig. 6.8].
Similarly, other oriented branches are drawn to obtain the graph.
2. How many trees are possible for the graph of the network of
Fig. 6.9? Draw the trees. (2) 3)
Ans. To draw the graph, sources are replaced by their internal
(4)
impedances and the network elements are replaced by lines. As the 1
Fig. 6.8
116 Fundamentals of Electric Circuit Theory
internal impedance of an ideal voltage source is zero, the voltage source v is replaced by a shorn
circuit. As the internal impedance of an ideal current source is infinite, the current source i is
replaced by an open circuit. There are three nodes and four branches, so that the graph of the
network is as shown in Fig. 6.10.
The complete incidence matrix is:

Nodes Branches

(1) (2) (3) (4)

0 1
2 [A)= 1
3 1

The reduced incidence matrix is

[A]= L 0 10
-1 1
0.
2 (2)
www.

(3)
(1)

1
Fig. 6.9 Fig. 6.10
The number of possible trees is

1 0 -1 1 [1 -1]
det {[A][A}} =det -1 0
-1 1 0 o
0

= det 3 =6-1=5.

The possible trees are shown in Fig. 6.11.

1
Fig. 6.11
3. For the network of Fig. 6.12, write the tie-set matrix and determine the KVL equations.
Calculate the loop currents.
Ans. The oriented graph with a possible tree is shown in Fig. 6.13, the twigs being shown
as solid lines and the links as dashed lines.
The tie-set matrix is
Elements of Graph Theory and Network Applications 117

fcircuits Branches
1) (2 (4) (5) (6)
0 1
2 [B] = 0 0 0
3

The KVL cquation is

B] ,]= 1B]|Z,) |B]' |7,1

(1)

/ 2Q D

B
w (5) (6)

B 3)
Fig. 6.12 Fig.6.13

10 0 07
Here [B]Iv,]=|0 1 0 -10-1
001 0 -11

i0 0 0 0 0
0 1 0 0 0 0
[io 0 1
o 0 10 00
B]1Z,]=| 0 10 -10 -1
00 0 2 0 0
0 01 0 -1 o 00 0 2 0
0 0 0 0 0 2
2 2 0
0 0
=01 0-2 0 -2
O01 0-2 2

0 0
I0 0 2 2 0
00
[B] 1Z,] |B =| 0 1 0 -2 0 -2
2 o
0 01 0 -2 2 1 0 -1

0 -1
5-2-2
2 5 -2

-2-2 5
118 undamentals of Electric Circuit Theory
The matrix form of the KVL cquations is

5-2-21|

The KVL cquations are

2 52/,-24
0 =-2/1, +511-2
= - 2 - 2 1 , +51
Note that these equations are the same as those obtained from conventional mesh analysis.
currents:
Solving the above equations using Cramer's rule we get for the loop

A =A,and I, =A
4. For the network of 6.14 give the fundamental cutset matrix and hence find the KCL
Fig.
equation.
6.15. The twigs are shown as solid
Ans. A tree of the network of Fig. 6.14 is shown in Fig.
lines and the links as dashed lines.
(2
ww

3)4
A 20 (1)
4)

Fig. 6.15
Fig. 6.14

is not shown in the graph as it is an open circuit.

The curent source

shown by dotted lines so that the fundamental cutsets are written as:
The cuts are

fcutset 1 : [1, 2]
fcutset 3: [3, 2, 4]
The f-cutset matrix is

Branches
f-cutsets
1) (2) (3 (4)
0

3 0

The KCL equation in matrix form is

IQi,J=10I>,11or iv,
I 0 0 |0
Here
0
Elements of Graph Theory and Network Applications 119

2 0 0 o1

QLy o -1 J|o 0 2 0

0 0
0 -I 2 1

o
So the KCL matrix equation is

5. Obtain the incidence matrix of the graph of the network of Fig. 6.16. Use it to obtain the
node admittance matrix. Establish the KCL equation in the matrix form and hence find the
voltage at the node 2. [cf Grad. IETE 1986]
(4)
23
ww
1U
(4)

(5) (6) (6)

1
(2) 2 »)2V (1) (2)
4
3)
(1)
4

Fig. 6.16 Fig. 6.17

Ans. The oriented graph of the network is shown in Fig. 6.17. The incidence matrix of the
graph is:

Nodes Branches

(1) (2) (3) 4) (5) (6)

- 1 1
0 0 0
2 [A] = 0 1

4 L -
0
1

The nodeadmittance matrix is given by y,) = [A] [v,] [A}', where y,] is the branch admittance
1
0
0
0

matrix.
Here 0 0 0 0 0
0 20 0 0 0
-10 0 -1 1 0
0 0 c 0 0 0
A]y,l=|0 0 0 -1 -1
00 0 20 0
00 -1
0 0 0 010
0 0 0 0 0
120 Fundamentals of Electric Círcuit Theory

- 0 0-21 0
0 2 0 0-1 -1

0 0-oo 201
Therefore.
-10 0
-0 0-2
0 0 -1
y,]=[A][v,][A} =|0 2 000-1 -1
-1 0
00-o 20 1
1 -1 0
0 -1

-I -2
-1 4 -1
-2 -1 oo

Note that D,] is symmetrical.

The KCL equation is

-1 2 0 0-2 1 0
or -1 4 1 HE 2 0 0 -1 -1
0
-2 -1 0 0 -oo 20
0

oo

or -1+4V2-2 0

Hence
- 1+4V2-2 = 0 or V2 3/4 volt.
6. Draw the oriented graph of the network of Fig. 6.18. Obtain the tie-set matrix and write the
network equations on KVL basis.

2 2
ww-
M=2H
2H 3H (1)(2) (3) (1 (3)

(D (2) (3)3F
2 2

(a) (b)
Fig. 6.18 Fig. 6.19
Elements of Graph Theory and Network Applications 121

Ans. The oriented graph of the given network is shown in Fig. 6.19 (a). A tree is shown in
Fig. 6.19 (6), the twig being shown in solid line. The links are shown by dashed lines. The tie-set
matrix is shown below:
f-circuit Branches
(1) 2) (3)
0

3
LB] =
L -1
The branch impedance matrix is :
2 0
Z,l=|0 2s 2s
0 2s 3s+1/3s
Note that here the mutual inductance* is positive so that the elements Zs and Z32 in [Z,] are
each equal to 2s. The loop impedance matrix is:
0
2s 25
1Z]=[B]|Z,]IBT= 0 s+1/3s
_2+25
s+1/3s
The KVL equation in matrix form is
[Z][]=[B][V,]
2+2s 1070
s+1/3s L .
o
(2+25)
(s+1/3s)/, ww
7. In the circuit of Fig. 6.20 determine the fundamental 4 2 0.5 A
cutset matrix by taking a suitable tree and calculate the
22
voltage v.
Ans. The voltage and current sources of Fig. 6.20 are v 4Q
2
converted into accompanied sources as shown in
Fig. 6.21 (a). The oriented graph is shown in Fig. 6.21 (6).
Fig. 6.20

(1) wQ
2
(2) ww- 1). (1).
22
V +
4 (4)
(2
3
a) (b) (C)
Fig. 6.21
*For a discussion of mutual inductance, see chapter 8.
122
Fundamentals of Electric Circuit
Theory
A suitable tree is drawn in Fig. 6.21 (c), the twigs being shown solid lines and the links
as
as
dashed lines. The cuts are shown by dotted circles, so that
the f-cutset matrix is as follows
f-cutset Branches
(1) (2) 3) 4)
1Q= 0 0 - 1

2 0

The KCL equation is

where the node pair admittance matrix Ly,] is

Here the branch admittance matrix , ] is

00 0
y]=|
o 0 0

Therefore, olly,J= 00 - and

Iy,=[Q][y.ItQ¥
1 01 .

00
-401
-1
o

Therefore, the KCL equation is

01
1 0 0 -1|
|0 1 -1 0| 0

or

Hence Y
HIH: - I or V, =v
So,
v-14V,-|v--v
8. For the network of Fig. 6.22, draw the oriented graph and for a suitable tree obtain the f
cutset matrix. Determine the node-pair equations and solve for the voltage
Elements of Graph Theory and Network Applications 123

Since the voltage

Ans. The oriented graph of the network of Fig. 6.22 is shown in Fig. 6.23 (a).
in
the possible tree is as shown
y is to be determined, branch (2) is chosen as a twig. Hence
lines. Thef-cutset
Fig. 6.23 (b), the twigs being drawn as solid lines. The links are drawn as broken
matrix is as follows:
(4) (4)

(2)
(1)
ww- www.
(1) 2)
2 Q 2 24) (1
2V 320
(2) ) 2
(a) (b)
Fig. 6.22 Fig. 6.23

f-cutset Branches

(1) (2) (3) (4)

1
20
4 -1

The set of node-pair equations are represented by

LOlly,1tQ IV,]=[Q1li,1-[0l[y,ll»,

Here o0.v.1=
ooo
0 2

Li,= and [v,]=|

0

-2
Hence the set of node pair equations are given by
o

and
-+V -2
Solving for v yields V
9
QUESTIONS
1. Define the following terms:
(a) Undirected graph, (b) directed graph. (c) rank of a graph, (d) incidence matrix. (e) f-circuits, and
(f) cutsets.
2. The branch and the loop currents of a network are related by i = l1, i = +ls - ls, i =1 -1s, i
= - 1 + , is = Is, and i, = ls. Here the small letters represent the branch currents and the capital
letters represent the loop currents. Draw the oriented graph of the network.
 Fundamentals of Electric Circuit Theory
124

matrix of a network is
3. The fundamental cutset

Branches
(2) (3) (4) (5) (6) 7)
()
0 0
- 1 0
0
0 0
1 0
0

Draw the directed graph.

Which one of the following
the set of edges (1, 3, 4, 7) is a tree.
4. In the following graph (Fig. 6.24)
sets is a fundamental circuit ?
IETE 1987] [Ans. (i)]
() (1, 2, 3, 4, 6) (i) 4, 5, 7) (ii) (2, 3, 5) (iv) (1, 4, 5, 6) [Grad.
2
2 ww.
ww

2 1V
19
2v w-

Fig. 6.24 Fig. 6.25

5. For the circuit of Fig. 6.25 draw the oriented graph and obtain the tieset matrix. Use this matrix too
[Ans. 0.91 A]
calculate the current i.
6. For the network of Fig. 6.26 draw the oriented graph and determine the fundamental cutset matrix.

Use this matrix to calculate the voltage Vo» Assume that the excitation frequency
is = I rad/s.
[Ans. 0.323 L43.3° V]
7. Draw the oriented graph of the network of Fig. 6.27. Determine the incidence matrix and use it to

find the voltages vi and v2. [Ans. v =-4.5 V; V2 = 5.5 V]

1 A

52
ww 10 S 10 2
M-
1H
2V 10Q
2H 2H 10 10
2V

Fig. 6.26 Fig. 6.27

8. The circuit of Fig. 6.28 contains a voltage dependent voltage source. For this circuit draw the oriented
graph. By choosing a proper tree obtain the tie-set matrix and hence calculate the voltage v,
Ans. 4/27 V]

5- 5Q

z5Q
Z5Q v, 4
V
Fig. 6.28