Answer to Question #15595 in Discrete Mathematics for Sujata Roy

Question #15595
The complete graph k6 has how many different Hamiltonian circuits? a) 6 b) 720 c) 120 d) 60
1
Expert's answer
2012-10-01T11:22:44-0400
1) Fix the vertex.
2) From each vertex we can go to another, so start on fix
vertex. We have 5 ways for start. Next we have 4 (5 - 1 from starting point to
this point) ways, next 3, 2, 1.
So, we have 5*4*3*2*1 circuits and 6 ways to
choose first vertex.
Answer 6*5*4*3*2*1=720 - b)

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be first!

Leave a comment

Ask Your question

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS
paypal