GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
102 views
Decomposition of complete graph into cycles through all vertices.
Continuing explanation [here][1],
Next explanation is given as

for $n=5$ , $n=7$, it suffices to use cycles formed by traversing the
vertices with constant difference:$\left(0,1,2,3,4\right)$,$\left(0,2,4,1,3\right)$ for $n=5 $

and

$\left(0,1,2,3,4,5,6\right)$,$\left(0,3,6,2,5,1,4\right)$ for $n=7 $

Not getting how
$\left(0,1,2,3,4\right)$,$\left(0,2,4,1,3\right)$  and  $\left(0,1,2,3,4,5,6\right)$,$\left(0,3,6,2,5,1,4\right)$ is coming from !!!!!

Please help me out!!

  [1]: http://math.stackexchange.com/questions/1985647/decomposition-of-complete-graph-into-cycles-through-all-vertices/1985652#1985652
asked in Graph Theory by (143 points)   | 102 views
The link that you have provided gives number of cycles in graph. But, in the example that you have given has some pattern.
but it is coming cycle rt?

Draw a complete graph with 5 vertices . (0,1,2,3,4) ,(0,2,4,1,3) both forming cycles
Yes, but answer would be different

Please log in or register to answer this question.



Top Users Aug 2017
  1. ABKUNDAN

    4660 Points

  2. Bikram

    4366 Points

  3. akash.dinkar12

    3258 Points

  4. rahul sharma 5

    3042 Points

  5. manu00x

    2682 Points

  6. makhdoom ghaya

    2410 Points

  7. just_bhavana

    2100 Points

  8. Tesla!

    1918 Points

  9. stblue

    1682 Points

  10. joshi_nitish

    1608 Points


24,928 questions
32,024 answers
74,385 comments
30,113 users