Graph Automorphisms
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
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
detailSectionParagraphPermanent Citation
"Graph Automorphisms"
http://demonstrations.wolfram.com/GraphAutomorphisms/
Wolfram Demonstrations Project
Published: December 6 2008
Graph Browser
Michael Schreiber
Hamiltonian Tours on Polyhedra
Ed Pegg Jr
Slider Puzzle
Jon McLoone
Graph Products
Benjamin Shemmer
Graph Puzzles
Karl Scherer
Animated Remainder Graph
Adam Rumpf
Random Key Graph
Jaebum Jung
Planar Graph Embeddings
Ed Pegg Jr
Random Graph Models
Jaime Rangel-Mondragon
Highlight Graph Elements
Jaime Rangel-Mondragon
-
Chiral Polyhedra
Eric W. Weisstein -
Archimedean Solids
Eric W. Weisstein -
Platonic Solids
Eric W. Weisstein -
Punched Sphere
Eric W. Weisstein -
Convex Hull
Eric W. Weisstein -
Applications of Lanchester's Square Law
Eric W. Weisstein -
Cumulation
Eric W. Weisstein -
Sudoku Logic
Eric W. Weisstein -
Intersection of a Convex Polyhedron and a Plane
Eric W. Weisstein -
Oloid
Eric W. Weisstein -
Population Sizes and Interactions during the Zombie Apocalypse
Eric W. Weisstein -
Cubic Equation
Eric W. Weisstein -
Graph Automorphisms
Eric W. Weisstein -
Quadratic Equation with Factored Form
Eric W. Weisstein -
Factoring Polynomials over Various Rings
Eric W. Weisstein -
The Rossler Attractor
Eric W. Weisstein -
n-Flakes
Eric W. Weisstein -
Mandelbrot's Binomial Measure Multifractal
Eric W. Weisstein -
Square Matrix Permutations
Eric W. Weisstein -
Irreducible Gaussian Fractions
Eric W. Weisstein