The GATE Grind

GATE 2007 CS – Question 23

Engineering Mathematics · Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) · 2 marks · Multiple choice

Which graph has an Eulerian circuit?

  1. Any k-regular graph for even k
  2. Complete graph on90 vertices
  3. Complement of a cycle on25 vertices
  4. None of these

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) Complement of a cycle on25 vertices

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions

All Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions →