Which of the following is true about euler circuit?

how to solve this?

Rahul @rahul55523
31 Jan 2017 11:12 pm

option B ?

sonali @sonalirangwani
1 Feb 2017 12:08 am

No. option c is correct

Ashish Kumar Goyal @dashish
1 Feb 2017 10:47 am

Ya it should be option C

Sumit Verma @sumitverma
1 Feb 2017 11:35 am

@sonalirangwani , No option is correct according to me. 
Graph with 6 vertices and with degree of each vertices as 2 can be disconnected.
Consider a case where 4 vertices are connected in a cycle and reamining two vertices are connected separetely. Also if the graph is disconnected, there is no meaning of talking about Euler circuit. So, both S1 and S2 are false.
In S3, they have not mentioned the no. of vertices, in this case the grapgh can also be disconnected. Consider two component of graph where each component is having 4 vertices of degree 3(Complete graph). So S3 is also incorrect.

Ashish Kumar Goyal @dashish
1 Feb 2017 11:51 am

S3 is true for 6 vertices!! They didn't mentioned so it should be false! Is it ??

Sumit Verma @sumitverma
1 Feb 2017 12:04 pm

yes @dashish, It will be true for 6 vertices.

Rahul @rahul55523
1 Feb 2017 01:07 pm

S2 they say euler circuit exist so it is possible for atleast 1 graph for all graph its not possible

sonali @sonalirangwani
1 Feb 2017 05:15 pm

I think they have taken 6 vertices according to the previous options. If the vertices are 6 then option C may true.