0
$\begingroup$

how to draw a graph with 5 vertices which is:

a)Eulerian cycle but not Hamiltonnian cycle. b)Hamiltonnian cycle but not Eulerian cycle. c)Eulerian cycle and Hamiltonnian cycle.

  • 0
    please help me answer this question2011-02-08
  • 3
    Write down the definitions of a Eulerian and Hamiltonian cycle and it should be quite easy with some trials. Do you remember the characterisation of Eulerian graphs ?2011-02-08
  • 0
    Eulerian cycle-accessible all node once and again,compulsory cross every node while Hamiltonian cycle-node must be pass through once only ,can skip node.2011-02-09
  • 0
    No, Eulerian cycles use all edges and return to start. Hamiltonian cycles use all vertices once each and return to start.2011-02-10

1 Answers 1