Prove that any graph with the degree sequence 2,5, 5, 7, 7, 7,7, 7, 7 is Hamiltonian. A complete tripartite graph is formed by taking three groups of vertices A, B, and C, then adding an edge between...

Extracted text: Prove that any graph with the degree sequence 2,5, 5, 7, 7, 7,7, 7, 7 is Hamiltonian. A complete tripartite graph is formed by taking three groups of vertices A, B, and C, then adding an edge between every pair of vertices in different groups. We write Kabe for the complete tripartite graph with |A| = a, |B| = b, and |C| = c. For example, below are diagrams of K2,4,5 (left) and K23,6 (right). (a) One of these graphs is Hamiltonian. Find a Hamiltonian cycle in that graph. (b) The other of these graphs is not Hamiltonian. Give a reason why it does not have a Hamiltonian cycle. (c) Generalize: find and prove a rule that tells you when Kabe is Hamiltonian. You may assume a <>