499 views

1 Answer

Best answer
1 votes
1 votes

Choose any 5 from given 8 Vertices in 8C5 ways.

Now do circular permutation on these 5 Vertices

So ans = 8C5 * 4!/2     (divide by 2 is due to clockwise and anticlockwise both would be same)

Ans is none of these

Similar Question : https://gateoverflow.in/473/gate2012-38

selected by

Related questions

0 votes
0 votes
1 answer
1
gmrishikumar asked Nov 30, 2018
874 views
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
3 votes
3 votes
0 answers
2
thepeeyoosh asked Dec 29, 2017
452 views
How many number of Hamiltonian cycles possible for a complete graph in all the case (i.e. ordered, unordered, edge-disjoint ...)??
2 votes
2 votes
0 answers
3
Sanket_ asked Jan 28, 2017
715 views
Which of the following statements is true?Every complete graph contain Hamiltonian cycleEvery complete graph contain Euler cycleBoth (a) and (b)None of the aboveIt should...