Let $G = (V, E)$ be an undirected unweighted connected graph. The $\textit{diameter}$ of $G$ is defined as: $$\text{diam}(G) = \max_{u,v \in V} \{\text{the length of shortest path between } u \text{ and } v\}$$ Let $M$ be the adjacency matrix of $G$. Define graph $G_2$ on the same set of vertices with adjacency matrix $N$, where $$N_{ij} = \begin{cases} 1 & \text{if } M_{ij} > 0 \text{ or } P_{ij} > 0, \text{ where } P = M^2 \\ 0 & \text{otherwise} \end{cases}$$ Which one of the following statements is true?

Let G = (V, E) be an undirected unweighted connected graph. The diameter of G is defined as: diam(G) = u,v 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 = cases 1 & if Mij > 0 or Pij > 0, where P = M2 \\ 0 & otherwise cases Which one of the following statements is true?

Topic-wise GATE CS PYQs with verified steps