Question

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

Answer 1

Answer:

A closed walk in a graph G containing all the edges of G is called an Euler line ... Since both G and Z have all their vertices of even degree, ... path, then it contains one or more cycles.