Let \(G=\left ( V,E \right )\) be \(any\) connected, undirected, edge-weighted…

GATE · 2017 · CS · Set 1 · Computer Science & IT

Let \(G=\left ( V,E \right )\) be \(any\) connected, undirected, edge-weighted graph. The weights of the edges in \(E\) are positive and distinct. Consider the following statements:

(I)   Minimum Spanning Tree of \(G\)  is always unique.

(II)  Shortest path between any two vertices of \(G\) is always unique.

Which of the above statements is/are necessarily true?

  1. A.

    I only

  2. B.

    II only

  3. C.

    both I and II

  4. D.

    neither I nor II

Attempted by 339 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…