Minimum number of elements in a generating set of a group.
You select a generating set of a group, and then you name every node with them, and you specify:
  • each node by a product of generators
  • each edge by what happens when you apply a generator to each element
Not unique: different generating sets lead to different graphs, see e.g. two possible for the
How to build it: good answer with ASCII art. You basically just pick each element, and repeatedly apply it, and remove any path that has a longer version.
Immediately gives the generating set of a group by looking at elements adjacent to the origin, and more generally the order of each element.
TODO uniqueness: can two different groups have the same cycle graph? It does not seem to tell us how every element interact with every other element, only with itself. This is in contrast with the Cayley graph, which more accurately describes group structure (but does not give the order of elements as directly), so feels like it won't be unique.
Take the element and apply it to itself. Then again. And so on.
In the case of a finite group, you have to eventually reach the identity element again sooner or later, giving you the order of an element of a group.
The continuous analogue for the cycle of a group are the one parameter subgroups. In the continuous case, you sometimes reach identity again and to around infinitely many times (which always happens in the finite case), but sometimes you don't.
The length of its cycle.