Graph Theory FAQs: 02. Graph Automorphisms
An automorphism of a graph G is an isomorphism between G and itself. The set of automorphisms of a graph forms a group under the operation of composition and is denoted Aut(G). The automorphisms of a graph describe the symmetries of the graph. We look at a few examples of graphs and determine their automorphisms. We also briefly look at how do find the automorphism group of a graph using Sage.
-- Graph Theory FAQs by Dr. Sarada Herke.
Related videos:
• Graph Theory: 09. Graph Isomorphisms - Graph Theory: 09. Graph Isomorphisms
• Graph Theory: 02. Definition of a Graph - Graph Theory: 02. Definition of a Graph
For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" - / spoonfulofmaths