Question

define Eulerian graph and Hamiltonian graph.Give an example of agraph which has both Haminltonian and Eulerian circuits​

Answer 1

Answer:

7

Explanation:

Hamiltonian Circuit: A Hamiltonian circuit in a graph is a closed path that visits every vertex in the graph exactly once. ... 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.