Question

every euler graph is a Hamiltonian graph ?​

Answer 1

Originally Answered: Is every Eulerian graph Hamilton? No. An Eulerian graph must have a trail that uses every EDGE in the graph and starts and ends on the same vertex. A Hamiltonian graph must contain a walk that visits every VERTEX (except for the initial/ending vertex) exactly once.

Answer 2

Answer:

Hamiltonian Graph: If a graph has a Hamiltonian circuit, then the graph is called a Hamiltonian graph. Important: An Eulerian circuit traverses every edge in a graph exactly once, but may repeat vertices, while a Hamiltonian circuit visits each vertex in a graph exactly once but may repeat edges.