πŸ“’ Too many exams? Don’t know which one suits you best? Book Your Free Expert πŸ‘‰ call Now!

  • google app store apple app store
  • βœ–

      Question

      Consider a weighted complete graph G on the vertex set

      {v1,v2 ,v} such that the weight of the edge (v,v) is 2|i-j|. The weight of a minimum spanning tree of G is:
      A n – 1 Correct Answer Incorrect Answer
      B 2n – 2 Correct Answer Incorrect Answer
      C nC2 Correct Answer Incorrect Answer
      D 2 Correct Answer Incorrect Answer

      Solution

      2n – 2

      Practice Next

      Relevant for Exams:

      ask-question