Let \(𝐺(𝑉, 𝐸)\) be an undirected and unweighted graph with 100 vertices.…
PYQ GATE 2025
Let be an undirected and unweighted graph with 100 vertices. Let denote the number of edges in a shortest path between vertices and in . Let the maximum value of such that , be 30. Let be any breadth-first-search tree of . Which ONE of the given options is CORRECT for every such graph ?
- A.
The height of
is exactly 15. - B.
The height of
is exactly 30. - C.
The height of
is at least 15. - D.
The height of
is at least 30.
Attempted by 310 students.
Sign up free to check your answer
Sign up freeLoading lesson…

