An automorphism of a graph $G$ is an isomorphism between $G$ and $G$ itself. How many automorphisms does the following (labelled) graph have:
$K_n − e$, i.e. the graph obtained from a complete graph with n vertices by deleting exactly one edge?
An automorphism of a graph $G$ is an isomorphism between $G$ and $G$ itself. How many automorphisms does the following (labelled) graph have:
$K_n − e$, i.e. the graph obtained from a complete graph with n vertices by deleting exactly one edge?