Answer (Choose 1 answer)
Multiple choices 3/50
A. i)
B. None of them
C. i) and ii)
D. ii)
Next
Which of the following statements are true?
D A minimum spanning tree in a connected weighted graph is a spanning tree that has th possible sum of weights of its edges.
ii) There is always a unique minimum spanning tree in a connected weighted graph
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27 28
29 30
31
32
33
34
35
36
37
38
39
40 41 47
43
44
45 46 47 48
49 50
