closed by
2,324 views
1 votes
1 votes
closed with the note: Answered

This is in reference to the below question

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

My doubt here is

In this question, we can also solve like first we select 4 vertices out of 6 in 6C4 ways.
Now we need to count how many cycles we can form with 4 vertices.And I think this is same as number of Hamiltonian circuits we can form in K4(Complete graph of 4 vertices)
so this is (n-1)! /2 which evaluates to 3 in case of n=4.So by multiplication rule, total cycles we have 45.Is this way correct?
 

closed by

Related questions

0 votes
0 votes
2 answers
2
yuuchan asked Jul 22, 2023
475 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
0 votes
0 votes
1 answer
3
angel rajput asked Feb 15, 2015
733 views
If I have any complete graph given then what is the approach to be followed up for calculating the number of paths of length n because for large value of n ,computation w...
0 votes
0 votes
0 answers
4