A graph G has an Euler cycle, then G is connected and every vertex has:

general knowledge science & technology

  1. even degree

  2. odd degree

  3. at least one loop

  4. none of these

Show answer
Correct Option: A

Find more quizzes: