Ask Your Question
1

Finding the generators for automorphisms of a graph

asked 2018-07-16 03:41:18 +0200

ASH gravatar image

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?

edit retag flag offensive close merge delete

Comments

Please provide an example of a graph where one encounters this problem.

slelievre gravatar imageslelievre ( 2018-07-16 08:57:56 +0200 )edit

1 Answer

Sort by ยป oldest newest most voted
1

answered 2018-07-16 11:12:26 +0200

tmonteil gravatar image

updated 2018-07-16 16:32:47 +0200

As in your previous question, you can use the tab-completion and discover the gens method:

sage: G = graphs.PetersenGraph()
sage: A = G.automorphism_group()
sage: A.gens()
[(3,7)(4,5)(8,9),
 (2,6)(3,8)(4,5)(7,9),
 (1,4,5)(2,3,8,6,9,7),
 (0,1)(2,4,6,5)(3,9,8,7)]

and even the gens_small one, which provides a small set of generators:

sage: A.gens_small()
[(0,5,7,2,1)(3,6,4,8,9), (0,9,8,2)(1,4,6,3)(5,7)]
edit flag offensive delete link more

Comments

Thanks, it works. Just out of curiosity, what is the small set of generators?

ASH gravatar imageASH ( 2018-07-17 04:12:54 +0200 )edit

You can have a look at the documentation by doing:

sage: A.gens_small?

So, it provides a set of generators with small cardinality, however it is not necessarilly minimal.

tmonteil gravatar imagetmonteil ( 2018-07-17 11:28:27 +0200 )edit

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 2018-07-16 03:41:18 +0200

Seen: 94 times

Last updated: Jul 16 '18