Question
Recall that the k-cube is the simple graph whose vertices are all sequences (a1,...,ak) with each ai either 0 or 1, and where two vertices
Recall that the k-cube is the simple graph whose vertices are all sequences (a1,...,ak) with each ai either 0 or 1, and where two vertices are adjacent precisely if their sequences dier at exactly one place.
(a) Let k 2. Show that Qk has two subgraphs G0 and G1, each isomorphic to Qk1, having no vertices or edges in common, and that each vertex of G0 is adjacent to one vertex of G1. Hint: Consider the vertices with last coordinate ak = 0 resp. ak = 1, and the edges between them.
(b) Use induction to prove that Qk is Hamiltonian for each k 2. Hint: In the induction step, use the subgraphs G0 and G1 from part (a).
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started