5 Values N Kn Euler Path B Kn Hamiltonian Path Q37023444

5. For what values of n (a) does Kn have an Euler path? (b) does Kn have a Hamiltonian path? Show transcribed image text 5. For what values of n (a) does Kn have an Euler path?
(b) does Kn have a Hamiltonian path?

Solution

5.a).A connected graph is said to have euler path if we canwalk(traverse) through all the edges of a connected graph in such away that no edge

OR

 

OR