An automorphism of a graph is an isomorphism between and itself. How many
automorphisms does the following (labelled) graph have:
, i.e. a cycle with vertices and a unique chord (i.e. with a unique edge
connecting two non-consecutive vertices of the cycle)?