Data Structures

1:

Which of the following graphs has an Eulerian circuit?

A.

Any k-regular graph where k is 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 : D

Explanation :

In a k-regular graph, all the vertices are of degree k. If all the vertices in a graph have even degree, there exists an Eulerian circuit (or cycle).

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.