In: Advanced Math
discrete math
4.
(4 pts) Be sure to explain all your answers.
(a) For which values of n does the graph Kn contain an Euler
circuit?
(b) For which values of n does the graph Kn contain a Hamilton
circuit?
thank you so much in advance!
(a) According to Euler's Theorem, for all Odd n(n > 1) i.e n = 3, 5, 7, 9, 11, ....
The complete graph Kn contain an Euler Circuit.
(b) According to Ore's Theorem, for all n > 2, yhe complete graph Kn contain Hamilton Circuit.