Beginner
Discrete Mathematics & Math
Q20 / 100
What is an Euler path in graph theory?
Correct! Well done.
Incorrect.
The correct answer is B) A path traversing every edge exactly once — exists iff the graph is connected and has exactly 0 or 2 vertices with odd degree
B
Correct Answer
A path traversing every edge exactly once — exists iff the graph is connected and has exactly 0 or 2 vertices with odd degree
Explanation
Euler path theorem (Königsberg bridge problem): exists iff ≤2 odd-degree vertices. If exactly 2 odd vertices: path starts at one and ends at other. If 0 odd vertices: Euler circuit (starts and ends same place).
Progress
20/100