A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 one year ago
CAN SOMEBODY HELP ME FIND A HAMILTON PATH BELOW.
anonymous
 one year ago
CAN SOMEBODY HELP ME FIND A HAMILTON PATH BELOW.

This Question is Closed

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0dw:1435337695042:dw

Astrophysics
 one year ago
Best ResponseYou've already chosen the best response.1Since circles have no vertices is there a rule for it to? I know we can only go through each vertice once right, mhm this seems pretty interesting.

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0yes , it has to go through one vertix once

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0The hint given is that the graph is symmetric around the vertix p

Astrophysics
 one year ago
Best ResponseYou've already chosen the best response.1How'd you come up with that

ganeshie8
 one year ago
Best ResponseYou've already chosen the best response.4i bruteforced : Notice that the hamiltonian path, if it exists, contains exactly 15 edges. We have 27 edges, so total number of choices = \( \binom{27}{15}\)

ganeshie8
 one year ago
Best ResponseYou've already chosen the best response.4all of them have repeated vertices, so...

ganeshie8
 one year ago
Best ResponseYou've already chosen the best response.4im not 100% sure of my method though @SithsAndGiggles

ganeshie8
 one year ago
Best ResponseYou've already chosen the best response.4dw:1435355081518:dw

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Mathematica agrees, the graph isn't Hamiltonian.

ganeshie8
 one year ago
Best ResponseYou've already chosen the best response.4thnks for checking @SithsAndGiggles do the commands work in wolfram ? if so can you please share them, just want to check how much time wolfram takes..

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0I don't think WA supports all the graph theory functions that Mma does, but it's worth a check. Snapshot below (some of the cluttered code is cut off).

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0`HamiltonianGraphQ` returns `True` if the graph is Hamiltonian, `False` otherwise. As for WA, I think the character count for the actual graph is too high.

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Apparently it's almost instantaneous? I don't know how complex the algorithm being used for the Hamiltonian test is.

ganeshie8
 one year ago
Best ResponseYou've already chosen the best response.4Oh then im sure Mma is using some kindof hueristics; the bruteforce method took more than 10 minutes to finish on my laptop
Ask your own question
Sign UpFind more explanations on OpenStudy
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
 Engagement 19 Mad Hatter
 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.