2 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 Graph Theory + – Sanket_ 1.0k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Kapil commented Jan 28, 2017 reply Follow flag Total number of hamiltonian cycles in a complete graph = $\frac{(N-1)!}{2}$ and a Complete graph with more than two vertices is Hamiltonian. I guess they should have mentioned it . 4 4 replyShare Sandeep Suri commented Jan 29, 2017 reply Follow flag yes they should mention it. graph with vertex>2 0 0 replyShare Lucky sunda commented Jan 29, 2017 reply Follow flag Nice point!! 0 0 replyShare Please log in or register to add a comment.
