edited by
25,076 views
76 votes
76 votes

Which of the following graphs has an Eulerian circuit?

  1. Any $k$-regular graph where $k$ is an even number.
  2. A complete graph on $90$ vertices.
  3. The complement of a cycle on $25$ vertices.
  4. None of the above
edited by

5 Answers

0 votes
0 votes
Option A is is correct but only for connected graphs. Once the 2k regular graphs are disconnected the they don’t form Euler’s circuit.

Option B is not true as can be concluded by analyzing.

Option C is true as we can reach the starting vertex always.

Hence best answer is option C.
Answer:

Related questions

19 votes
19 votes
3 answers
5
Kathleen asked Sep 21, 2014
10,114 views
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has9 edges and 5 vertices9 edges and 6 vertices10 edges and 5 vertices10 edges and 6 v...
73 votes
73 votes
6 answers
6
Ishrat Jahan asked Oct 29, 2014
21,366 views
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ?$1$$2$$3$$n$
43 votes
43 votes
8 answers
7
32 votes
32 votes
9 answers
8
makhdoom ghaya asked Feb 13, 2015
24,384 views
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.