Tut1 2016
Tut1 2016
5
4 2
a b
1
Figure 1
2. Sk etch a connected graph G and a tree T of it, such that the co -tree of T is also
another tree of G.
5
9
8
7
10
3
6 1
2
4 11
Figure 2
4.
(i) The coefficient matrix A of a set of equations is called the “ incidence matrix”
of the graph. Define the incidence matrix for a general connected graph.
(ii) Then, consider a network having Figure 3 as its graph. W rite down the KCL-
equations at each node ( a, b, c, d, e and f), with the elem ent currents being
designated as i 1 , i 2 , i 3 , i 4 , i 5 , i 6 , i 7 and i 8 . Put the equations in m atrix form such
that Ai 0 , where i= [i 1 , i 2 , i 3 , i 4 , i 5 , i 6 , i 7 , i 8 ] is a column vector.
1 b 6
a c
2 4 7
d e
5 f 8
Figure 3
W here the rows ( I, II and III) denote the loops while the colum ns ( 1, 2, 3, 4, 5
and 6) denote the branches. Based on the matrix D, draw an oriented tree.
Label the nodes and branches clearly. [Hint: Assume branches 1, 2 and 3 are
the tree branches while 4, 5 and 6 are the co -tree branc hes/links.]
50V
Figure 4
2015/2016