Computer Sciences > Gate 2017 Set-1 > Graph Theory
Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
Which of the above statements is/are necessarily true?
I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices 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?
Correct : a
Similar Questions
Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
Total Unique Visitors
Loading......