I have to prove that a hypercube Bn is Hamiltonian if n is greater than than or equal to 2, I think induction would be the best way to prove it but I am not sure. Any ideas?
I have to prove that a hypercube Bn is Hamiltonian if n is greater than than or equal to 2, I think induction would be the best way to prove it but I am not sure. Any ideas?
Sounds right. Prove that
* B2[/sub] is Hamiltonian, and that
* If you have a hamiltonian path on B[sub:17sjl6tw]n-1[/sub:17sjl6tw], you can build one on B[sub:17sjl6tw]n[/sub:17sjl6tw]. It's not difficult, draw a picture of B[sub:17sjl6tw]2[/sub:17sjl6tw], B[sub:17sjl6tw]3[/sub:17sjl6tw], then maybe B[sub:17sjl6tw]4[/sub:17sjl6tw], so you can see how each is built from two copies of the one before.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
