GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
95 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)   | 95 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 Jun 2017
  1. Bikram

    3704 Points

  2. Arnab Bhadra

    1502 Points

  3. Hemant Parihar

    1502 Points

  4. Niraj Singh 2

    1481 Points

  5. junaid ahmad

    1432 Points

  6. Debashish Deka

    1384 Points

  7. Rupendra Choudhary

    1220 Points

  8. rahul sharma 5

    1220 Points

  9. Arjun

    1168 Points

  10. srestha

    1010 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 26 - Jul 02
  1. Arjun

    208 Points

  2. akankshadewangan24

    152 Points

  3. Debashish Deka

    138 Points

  4. Hira Thakur

    130 Points

  5. Soumya29

    106 Points


23,399 questions
30,111 answers
67,490 comments
28,426 users