🎴 Flashcard Mode
Test 2 Algorithms | Computer Science
Card1 / 20
Mastered0
Review0
QuestionClick to flip
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?
AnswerClick to flip back
A
There must exist a vertex w adjacent to both u and n in G.
💡 Explanation:
