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 gate computer science 2017
The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Hey! Want to work with us? Our youtube channel See our Jd Want to apply? Do it today

### Use Me  ?

New searches
GATE-Computer-Science-Engineering-2017-->View question

## 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: -gate computer science 2017

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 ?

A) I only
B) II only
C) both I and II
D) neither I and II

By:satyashiromani

Taged users:

Likes:
|deepuckraj|satyashiromani

Dislikes:
Be first to dislike this question

A) I only

Explanation:
I. Minimum Spanning Tree of G is always unique - MST will wlways be distinct if the edges are unique so Correct II. Shortest path between any two vertices of G is always unique - Shortest path between any two vertices can be same so incorrect Therefore, option A is correct .

This explanation is contributed by Deepak Raj.

deepuckraj

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer