Having a large graph, it will cause memory and kernel issues for SAGE to list all graph automorphisms. Is there a way to find the generators of the automorphisms instead of the whole automorphisms of a graph?
1 | initial version |
Having a large graph, it will cause memory and kernel issues for SAGE to list all graph automorphisms. Is there a way to find the generators of the automorphisms instead of the whole automorphisms of a graph?