Description Usage Arguments Details Value Author(s) References See Also Examples

Calculate the number of automorphisms of a graph, i.e. the number of isomorphisms to itself.

1 | ```
automorphisms(graph, sh = "fm")
``` |

`graph` |
The input graph, it is treated as undirected. |

`sh` |
The splitting heuristics for the BLISS algorithm. Possible values
are: ‘ |

An automorphism of a graph is a permutation of its vertices which brings the graph into itself.

This function calculates the number of automorphism of a graph using the BLISS algorithm. See also the BLISS homepage at http://www.tcs.hut.fi/Software/bliss/index.html.

A named list with the following members:

`group_size` |
The size of the automorphism group of the input graph, as a string. This number is exact if igraph was compiled with the GMP library, and approximate otherwise. |

`nof_nodes` |
The number of nodes in the search tree. |

`nof_leaf_nodes` |
The number of leaf nodes in the search tree. |

`nof_bad_nodes` |
Number of bad nodes. |

`nof_canupdates` |
Number of canrep updates. |

`max_level` |
Maximum level. |

Tommi Junttila (http://users.ics.aalto.fi/tjunttil/) for BLISS and Gabor Csardi csardi.gabor@gmail.com for the igraph glue code and this manual page.

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.

`canonical_permutation`

, `permute`

1 2 3 4 | ```
## A ring has n*2 automorphisms, you can "turn" it by 0-9 vertices
## and each of these graphs can be "flipped"
g <- make_ring(10)
automorphisms(g)
``` |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.