Register

Gate 2016
closed

• closed by
597 views
0 0 votes
closed as a duplicate of: GATE CSE 2016 | Set 1 | Question: 14
Let G be aweighted connected undirected graph with distinct positive edge weights.If every
edge weight is increased by the same value,then which of the following statements is/are
TRUE?
P: Minimum spanning tree of G does notchange
Q: Shortest path between any pair of vertices doesnot change
(A) P only
(B) Q only
(C) NeitherPnorQ
(D) Both PandQ
 

 

answer is a.

why not D ,I think Shortest path between any pair of vertices will also not change.
Voting & Accepting an answer helps improve the community
← Previous · #toc #regular langua...Next → · doubt in window size
← Previous in category · Picked from other qu...Next in category → · Modified GATE-2014 C...
Position:
Show:

Related questions

0 0 votes
0 0 answers
565
565 views
Balaji Jegan asked Oct 23, 2018
565 views
TANCET 2016 DFS
91 91 votes
11 answers 11 answers
45.3k
45.3k views
Sandeep Singh asked Feb 12, 2016
45,310 views
GATE CSE 2016 | Set 1 | Question: 11
Consider the following directed graph:The number of different topological orderings of the vertices of the graph is _____________.
126 126 votes
11 answers 11 answers
33.3k
33.3k views
Akash Kanase asked Feb 12, 2016
33,265 views
GATE CSE 2016 | Set 2 | Question: 41
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $...
71 71 votes
10 answers 10 answers
24.6k
24.6k views
Akash Kanase asked Feb 12, 2016
24,566 views
GATE CSE 2016 | Set 2 | Question: 11
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n^{\text{th}...