700 views
2 votes
2 votes

Which of the following statements is true?

  • Every complete graph contain Hamiltonian cycle
  • Every complete graph contain Euler cycle
  • Both (a) and (b)
  • None of the above

It should be none of the above because when no. of vertices are 2  it doesnt follow these conditions 

Please log in or register to answer this question.

Related questions

4 votes
4 votes
2 answers
1
Jason GATE asked Jan 31, 2017
1,911 views
Which of the following Graph has Euler Path but is not an Euler Graph?A. K1,1 B.K2,10 C.K2,11D.K10,11.
0 votes
0 votes
1 answer
3
gmrishikumar asked Nov 30, 2018
852 views
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
1 votes
1 votes
1 answer
4
akash.dinkar12 asked Jan 1, 2018
474 views