Dihedral graph

Definition

Let $n$ be a natural number that is at least 3. The dihedral graph on $2n$ vertices is defined in the following equivalent ways:

1. It is the prism of the cycle graph on $n$ vertices
2. It is the Cayley graph of the groupprops:dihedral group of degree $n$ (order $2n$) where we take the generating set as follows: a generator of the cyclic subgroup of index two (and its inverse) and an element of order two outside the subgroup.