GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
92 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 (67 points)   | 92 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 Feb 2017
  1. Arjun

    5386 Points

  2. Bikram

    4230 Points

  3. Habibkhan

    3952 Points

  4. Aboveallplayer

    3086 Points

  5. Debashish Deka

    2564 Points

  6. sriv_shubham

    2318 Points

  7. Smriti012

    2236 Points

  8. Arnabi

    2008 Points

  9. mcjoshi

    1696 Points

  10. sh!va

    1684 Points

Monthly Topper: Rs. 500 gift card

20,863 questions
26,021 answers
59,689 comments
22,131 users