Please Login to access more options.
Problem 19(Automorphisms On Several Graphs With 4 Vertices)
Consider the two graphs below.
- For each graph, list the automorphisms of the graph. Use disjoint cycle notation to represent each automorphism.
- For each automorphism, state the smallest positive value of $k$ for which $\sigma^k$ is the identity automorphism. This is called the order of the automorphism.
- Construct another graph on 4 vertices different than the three we have seen so far. How many automorphisms does this graph have? Explain.
The following pages link to this page.
- Problem.AutomorphismsOnSeveralGraphsWith4Vertices
- Problem.CayleyGraphsOfTwoAutomorphismGroups
- Schedule.20160919
- Schedule.20160921
- Schedule.20160923
- Schedule.20160926
- Schedule.20170918
- Schedule.20170920
- Schedule.20170922
- Schedule.20170925
- Schedule.20170927
- Schedule.AllProblems
- Solution.AutomorphismsOnSeveralGraphsWith4VerticesJosh