partition=set of sets

This option specifies a partition P of the vertices of G and restricts the automorphism group returned to those automorphisms which preserve this partition; that is, for each vertex set P[i] in P and each vertex v in P[i], only those automorphisms which map v to a vertex in P[i] are included.

The partition is permitted to be a proper subset of the vertices of G; in this case, any vertex not included in the partition form an additional implicitly defined subset.

The default is the empty set, meaning that no restrictions are imposed on the automorphisms returned.

storage=rectangular, sparse, or auto

This option controls whether the dense or sparse algorithm from the Nauty library is used. The values rectangular and sparse correspond to the dense and sparse algorithms, respectively, while the value auto means that Maple automatically determines which algorithm to employ based on a heuristic depending on the number of vertices and edges in G. The default is auto.

The AutomorphismGroup( G ) command computes the group of automorphisms of a given graph G.

The automorphism group is represented as a permutation group.

The graph G may be directed or undirected, but must be unweighted.

Let G be a graph with vertex set V.

An automorphism $\mathrm{\sigma }$ of a graph G is a permutation of V such that for any pair of vertices u and v in V, there is a (directed) edge from u to v in G if and only if there is a (directed) edge from $\mathrm{\sigma }\left(u\right)$ to $\mathrm{\sigma }\left(v\right)$.

The set of automorphisms of G form a group. The group identity is the automorphism that is the identity mapping on V, and the group operation is function composition.

No general polynomial-time algorithm for computing graph automorphisms is presently known.

This command makes use of the Nauty library for computing automorphism groups and canonical labelings.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$$\mathrm{with}\left(\mathrm{GroupTheory}\right)\:$

$\mathrm{C5}≔\mathrm{CycleGraph}\left(5\right)$

$\mathrm{C5}≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 5\; vertices\; and\; 5\; edge(s)}$

$G≔\mathrm{AutomorphismGroup}\left(\mathrm{C5}\right)$

$G≔⟨\left(1\,2\right)\left(3\,5\right)\,\left(2\,5\right)\left(3\,4\right)⟩$

$\mathrm{AreIsomorphic}\left(G\,\mathrm{DihedralGroup}\left(5\right)\right)$

$\mathrm{true}$

$\mathrm{K4}≔\mathrm{CompleteGraph}\left(4\right)$

$\mathrm{K4}≔\mathrm{Graph\; 2:\; an\; undirected\; graph\; with\; 4\; vertices\; and\; 6\; edge(s)}$

$G≔\mathrm{AutomorphismGroup}\left(\mathrm{K4}\right)$

$G≔⟨\left(1\,2\right)\,\left(2\,3\right)\,\left(3\,4\right)⟩$

$\mathrm{AreIsomorphic}\left(G\,\mathrm{SymmetricGroup}\left(4\right)\right)$

$\mathrm{true}$

$\mathrm{PG}≔\mathrm{SpecialGraphs}:-\mathrm{PetersenGraph}\left(\right)$

$\mathrm{PG}≔\mathrm{Graph\; 3:\; an\; undirected\; graph\; with\; 10\; vertices\; and\; 15\; edge(s)}$

$G≔\mathrm{AutomorphismGroup}\left(\mathrm{PG}\right)$

$G≔⟨\left(2\,5\right)\left(3\,4\right)\left(7\,10\right)\left(8\,9\right)\,\left(3\,9\right)\left(4\,8\right)\left(7\,10\right)\,\left(4\,7\right)\left(5\,6\right)\left(8\,10\right)\,\left(1\,2\right)\left(3\,5\right)\left(6\,9\right)\left(7\,8\right)⟩$

$\mathrm{GroupOrder}\left(G\right)$

$120$

"Graph automorphism", Wikipedia. https://en.wikipedia.org/wiki/Graph_automorphism

The GraphTheory[AutomorphismGroup] command was introduced in Maple 2017.

For more information on Maple 2017 changes, see Updates in Maple 2017.

The GraphTheory[AutomorphismGroup] command was updated in Maple 2020.

The partition option was introduced in Maple 2020.

For more information on Maple 2020 changes, see Updates in Maple 2020.