Beruflich Dokumente
Kultur Dokumente
:::::::::::::::::::::::::::
:
Name
(b) All choices include all nodes of the given graph but
the this subgraph shown on the right-hand-side [which
matches one of the choice above ] is a tree as it does NOT
contain any close path .
:::::::::::::
2. Number of tie-sets that can be obtained from a tree of the graph of Fig. (1) is [2]
(a) 3 (b) 4
(c) 5 (d) 6
(b) The given graph has n = 4 and b = 7. So, the number of twigs, t, available in any tree
constructed out of the given graph is t = n 1 = 4 1 = 3. Thus, the total number of links, l,
is l = b t = b n + 1 = 7 3 = 4. We also know that there will be one and only one tie-set
(f loop/circuit) for each link. Hence, the answer is 4 (four).
Fig. 2
ib + ic id = 0 I0 ib = 0.5A id =? 6
R
ic = 0A
0.5 + 0 id = 0
id = 0.5 A 0
(c) 5 V (d) 6 V
+ V
1V + 47
6V
+
Fig. 3
2060720-MidTerm#20151021ENT 1/2
L. Joyprakash Singh, PhD EE - 304 ENT October 21, 2016
(c) (d)
2
+
2 i1 1
3
RT H
Fig. 4
at node x as i1
+
1 vtest 1A
vtest i1 vtest
+ + i1 = 0
2 1
1
vtest = V
3
Hence,
vtest 1
RT H = =
1 3