Post your solutions to the May 3 In-Class exercise here.
Best, Chris
Graph G1 { Vertices: 1, 2, 3, 4 Edges: (1,2) (1,3) (2,4) (3,4) (2,3) }
Graph G2 { Vertices: 1, 2, 3, 4 Edges: (1,2) (1,4) (2,4) (3,4) (2,3) }
G1 isomorphs to G2 by swapping 3 and 4
G3 is an automorphism for G1:
Graph G3 { Vertices: 1, 2, 3, 4 Edges: (1,2) (1,3) (1,4) (3,4) (2,3) }