Graph Theory

Math 235 Homework 10 Due Monday, November 29 before midnight
For this homework assignment, please type your answers in L ATEX, using the template I gave you as a starting point.
22.6 The wheel graph Wn consists of a cycle graph Cn together with one extra vertex that is adjacent to all other vertices (so actually, the wheel graph Wn has n + 1 vertices). (a) What is the degree sequence of Wn? (b) Prove that Wn is Hamiltonian for all n ≥ 3.
23.4 For which values of n does the complete graph Kn have an Euler circuit?