Graph Automorphisms

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.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.