Question 8028 – GATE 2016 [Set-1]
January 27, 2024Question 10449 – Semaphores
January 27, 2024Engineering-Mathematics
|
Question 1
|
Let G = (V, E) be an undirected unweighted connected graph. The diameter of G is defined as:
Let M be the adjacency matrix of G.
Define graph G2on the same set of vertices with adjacency matrix N, where
Which one of the following statements is true?
Let M be the adjacency matrix of G.
Define graph G2on the same set of vertices with adjacency matrix N, where
Which one of the following statements is true?
![]() |
|
![]() |
|
![]() |
|
![]() |
Question 1 Explanation:



Correct Answer: B
Question 1 Explanation:







