Multiple choices 23/50
(Choose 1 answer)
How many edges must be removed from a connected graph with n vertices and m edges to produce a spanning tree?
A. mn+1
B.m-n-1
C. n-m-1
D. m-n
E. None of the other choices is correct.
Next
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
42
43
44
45
46
47 48
49 50
