Top MCQs on Graph Theory in Mathematics
Question 91
Consider a graph G=(V, E), where V = { v1,v2,…,v100 }, E={ (vi, vj) ∣ 1≤ i < j ≤ 100} and weight of the edge (vi, vj) is ∣i–j∣. The weight of minimum spanning tree of G is ________. Note - This question was Numerical Type.
There are 91 questions to complete.
Last Updated :
Take a part in the ongoing discussion