Question

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

Answer 1

connected graph G is Hamiltonian if there is a cycle which includes every vertex of G; such a cycle is called a Hamiltonian cycle. ... This graph is BOTH Eulerian and Hamiltonian. This graph is Eulerian, but NOT Hamiltonian. This graph is an Hamiltionian, but NOT Euler