Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

calliendra Group Title

For a theoretical graph, the n-th cube Q_n is a simple graph whose verices are the 2^n points (x_1...x_n) in R^n. So that for each x_i=0 or 1, and whose two vertices adjacent if thet agree in exactly n-1 coordinates. show that if n>=2 the Q_n has a hamiltonian cycle.

  • 8 months ago
  • 8 months ago

  • This Question is Closed
  1. calliendra Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    • ok. so i am going to use induction and i hasve my base step be N=2 so i have a 2 dimensional cube with 2^2=4 vertives in R^2. with coordinates (00) (01) (10)(11)... which is really a two dimensional square with those coordinates as vertices. i can easily see it is a hamiltonian cycle.true.

    • 8 months ago
  2. calliendra Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    i can even visualize a 3d cube whose eight vertices in R3whose edges are named: (000)(001)(010)(100)(011)(101)(110)(111) create a cube. which creates a hamiltonian cycyle. |dw:1383750838900:dw|

    • 8 months ago
  3. calliendra Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    however when i get to the n and n+1 i can't think of it... i don't know how to PROVE there is a hamiltonian cycle ... unless there is some formula that i can find to guarantee the edge numbers i need....

    • 8 months ago
    • Attachments:

See more questions >>>

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.