Let be an undirected unweighted connected graph. The diameter of is defined as
Let be the adjacency matrix of .
Define graph on the same set of vertices with adjacency matrix , where
Which one of the following statements is true?
- A
- B
- C
- D
Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MCQ2 marks · −2/3 if wrongHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.