Let T be a depth first search tree in an undirected graph G. Vertices u and n…
GATE · 2006 · CS
Let T be a depth first search tree in an undirected graph G. Vertices u and n are leaves of this tree T. The degrees of both u and n in G are at least 2. which one of the following statements is true?
- A.
There must exist a vertex w adjacent to both u and n in G
- B.
There must exist a vertex w whose removal disconnects u and n in G
- C.
There must exist a cycle in G containing u and n
- D.
There must exist a cycle in G containing u and all its neighbours in G.
Attempted by 157 students.
Sign up free to check your answer
Sign up freeLoading lesson…