I am interested in the graph theory/combinatorics problem:
if you have a cycle, how many ways can you rearrange the edges and nodes such that you still only have one cycle?
any discussion is welcome
To state it another way
If the graph itself was simply one large cycle, how many ways could I rearrange the edges while maintaining a single cycle? Only one incoming and outgoing edge per node and therefore the length of the cycle must be the same with each permutation.
nodes are marked edges are not.
Does that may things clearer?