4#1 Due Thursday, October 10: (Related to West 1.3.23) As West describes
in the last paragraph of Example 1.3.8, the
k-dimensional hypercube, Qk, can be
defined recursively as follows: Q0 is a single vertex.
Qk is constructed from two copies of
Qk-1; the two copies are stapled together by
connecting like vertices.
Use the recursive description of Qk to prove by
induction that n(Qk) = 2k.
Then, prove by induction that e(Qk) =