GATE Computer Science (CS) 2021 Shift 1 Solved Paper

© examsiri.com
Question : 46 of 65
 
Marks: +1, -0
Let G = (V, E) be an undirected unweighted connected graph. The diameter of G is defined as:
diam(G) =  maxlimitsu,x∈V  {the length of shortest path between u and v}
Let M be the adjacency matrix of G.
Define graph G2 on the same set of vertices with adjacency matrix N, where
Nij={1 if Mij>0 or Pij>0 where P=M20 otherwise .
Which one of the following statements is true?
Go to Question: