See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

## 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:

|Aparna-Dasgupta|tarun101|metaphor|satyashiromani|Msshikhil|vaishnavi-Deshpande|Umang|ThreeRed|deepuckraj|Akhil-Raj|Manisha12|RaviTeja-lovesall-|Shivam-Yadav|rajeshdotsinghgmailcom|milan-ransingh|milanyoyoyogmailcom|13priya|aksingh1818|Amogh|Khushveer|salazar|leo|Aaditi|madachod|tichaona-garaidenga|ronald|akialwayz|jinsnjjose|dillu550|sumesh

Likes:

|deepuckraj|satyashiromani

Dislikes:

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

## Answers

**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

Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

------------------------------------

## Use Me ?