1 | initial version |

The system is right!

The Cayley graph (and its diameter) depends not only of the group but also on a set of generators, and a group can have more than one sets of generators. For example, if you take the integers modulo 6 with the addition, then both {1} and {2,3} are sets of generators, with different Cayley graphs.

The method `.gens()`

choses a particular set of generators. In the `.cayley_graph()`

method, you can change this arbitrary choice by setting your own set of generators.

2 | No.2 Revision |

The system is right!

The Cayley graph (and its diameter) depends not only of the group but also on a set of generators, and a group ~~can have ~~usually has more than one sets of generators. For example, if you ~~take ~~consider the group of integers modulo 6 ~~with ~~(with the ~~addition, ~~addition), then both {1} and {2,3} are sets of generators, with different Cayley graphs.

The method `.gens()`

choses a particular set of generators. In the `.cayley_graph()`

method, you can change this arbitrary choice by setting your own set of ~~generators.~~generators (type `gd.cayley_graph?`

for more details).

3 | No.3 Revision |

The system is right!

The Cayley graph (and its diameter) depends not only of the group but also on a set of generators, and a group usually has more than one sets of generators. For example, if you consider the group of integers modulo 6 (with the addition), then both {1} and {2,3} are sets of generators, ~~with ~~leading to different Cayley graphs.

The method `.gens()`

choses a particular set of generators. In the `.cayley_graph()`

method, you can change this arbitrary choice by setting your own set of generators (type `gd.cayley_graph?`

for more details).

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.