An undirected graph G(V, E) contains n ( n < 2 ) nodes named v1,v2 ,.vn. Two…
An undirected graph G(V, E) contains n ( n < 2 ) nodes named v1,v2 ,.vn. Two nodes vi, vj are connected if and only if 0 <|i j| <= 2. Each edge (vi, vj) is assigned a weight i + j. What will be the cost of the minimum spanning tree (MST) of such a graph
- A.
1/12(11n^2 − 5n)
- B.
n^2 − n + 1
- C.
6n − 11
- D.
2n + 1
Attempted by 152 students.
Sign up free to check your answer
Sign up freeLoading lesson…