GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
84 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 (51 points)   | 84 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 Jan 2017
  1. Debashish Deka

    8322 Points

  2. sudsho

    5166 Points

  3. Habibkhan

    4718 Points

  4. Vijay Thakur

    4468 Points

  5. Bikram

    4420 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4072 Points

  8. santhoshdevulapally

    3732 Points

  9. Sushant Gokhale

    3514 Points

  10. GateSet

    3336 Points

Monthly Topper: Rs. 500 gift card

19,158 questions
24,065 answers
52,872 comments
20,288 users