A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

dan815

  • one year ago

To graph or not to graph, that is the question: Decomposition and Hamilton Cycles: Find a Hamilton cycle and a Hamilton path in each of the graphs if they exist in each of these pictures Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian path that is a cycle. http://prntscr.com/8m1amp http://prntscr.com/8m1eyy

  • This Question is Closed
  1. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Graph!

  2. ShadowLegendX
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Graph it bby

  3. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    xD i dint even get a chance to finish my question

  4. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    lol

  5. ShadowLegendX
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Graph y = x c;

  6. ShadowLegendX
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Suppah hard ik

  7. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Hamilton cycle for the D graph, its fun :)

  8. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    whats more fun is eating a bowl of pasta

  9. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    hahaha xD

  10. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1443581032622:dw|

  11. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1443581277328:dw|

  12. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    isn't there a unique cycle for this? i never studied this in too much depth

  13. dan815
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    im not sure i think therse a couple

  14. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

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.