Skip to content
Related Articles
GATE | GATE-CS-2007 | Question 23
• Difficulty Level : Medium
• Last Updated : 23 Feb, 2014

Which of the following graphs has an Eulerian circuit?
(A) Any k-regular graph where kis an even number.
(B) A complete graph on 90 vertices
(C) The complement of a cycle on 25 vertices
(D) None of the above

Answer: (C)

Explanation: A graph has Eulerian Circuit if following conditions are true.

….a) All vertices with non-zero degree are connected. We don’t care about vertices with zero degree because they don’t belong to Eulerian Cycle or Path (we only consider all edges).
….b) All vertices have even degree.

Let us analyze all options.
A) Any k-regular graph where k is an even number. is not Eulerian as a k regular graph may not be connected (property b is true, but a may not)

B) A complete graph on 90 vertices is not Eulerian because all vertices have degree as 89 (property b is false)

C) The complement of a cycle on 25 vertices is Eulerian. In a cycle of 25 vertices, all vertices have degree as 2. In complement graph, all vertices would have degree as 22 and graph would be connected.

Quiz of this Question

Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up