Graph Automorphisms

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

An automorphism of a graph is a graph isomorphism with itself, that is, a mapping from the vertices of the given graph back to vertices of such that the resulting graph is isomorphic with . This Demonstration enumerates the automorphisms of some small simple graphs.

Contributed by: Eric W. Weisstein (December 2008)
Open content licensed under CC BY-NC-SA


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send