Generating set of the automorphism group of a graphSource:
Compute the generating set of the automorphism group of a graph.
automorphism_group( graph, colors, sh = c("fm", "f", "fs", "fl", "flm", "fsm"), details = FALSE )
The input graph, it is treated as undirected.
The colors of the individual vertices of the graph; only vertices having the same color are allowed to match each other in an automorphism. When omitted, igraph uses the
colorattribute of the vertices, or, if there is no such vertex attribute, it simply assumes that all vertices have the same color. Pass NULL explicitly if the graph has a
colorvertex attribute but you do not want to use it.
The splitting heuristics for the BLISS algorithm. Possible values are: ‘
f’: first non-singleton cell, ‘
fl’: first largest non-singleton cell, ‘
fs’: first smallest non-singleton cell, ‘
fm’: first maximally non-trivially connected non-singleton cell, ‘
flm’: first largest maximally non-trivially connected non-singleton cell, ‘
fsm’: first smallest maximally non-trivially connected non-singleton cell.
Specifies whether to provide additional details about the BLISS internals in the result.
FALSE, a list of vertex permutations
that form a generating set of the automorphism group of the input graph.
TRUE, a named list with two members:
Returns the generators themselves
Additional information about the BLISS internals. See
count_automorphisms()for more details.
An automorphism of a graph is a permutation of its vertices which brings the graph into itself. The automorphisms of a graph form a group and there exists a subset of this group (i.e. a set of permutations) such that every other permutation can be expressed as a combination of these permutations. These permutations are called the generating set of the automorphism group.
This function calculates a possible generating set of the automorphism of a graph using the BLISS algorithm. See also the BLISS homepage at http://www.tcs.hut.fi/Software/bliss/index.html. The calculated generating set is not necessarily minimal, and it may depend on the splitting heuristics used by BLISS.
Tommi Junttila and Petteri Kaski: Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics. 2007.
Other graph automorphism:
Tommi Junttila (http://users.ics.aalto.fi/tjunttil/) for BLISS, Gabor Csardi firstname.lastname@example.org for the igraph glue code and Tamas Nepusz email@example.com for this manual page.
## A ring has n*2 automorphisms, and a possible generating set is one that ## "turns" the ring by one vertex to the left or right g <- make_ring(10) automorphism_group(g) #> [] #> + 10/10 vertices, from 9be8e32: #>  1 10 9 8 7 6 5 4 3 2 #> #> [] #> + 10/10 vertices, from 9be8e32: #>  2 3 4 5 6 7 8 9 10 1 #>