I understand that the automorphism group of an $n$ cycle graph is the dihedral group $D_n$ of order $2 n$. From the comment of @Christian, I also understand that $S_n$ is the automorphism group of the complete graph $K_n$ which has $D_n$.
Other than these two obvious cases, I would like to know what are the other known automorphism groups of graphs which have $D_n$ as a subgroup. Of course, the easiest are the graphs which have multiple $n$ cycle graphs as subgraphs or multiple $K_n$ as subgraphs. But, are there other graphs?
One can define various structures such as graphs of valency $k$ (for some fixed $k \ge 3$), bipartite graphs, strongly regular graphs, $k$-chromatic graphs (for fixed $k \ge 2$), or $k$-connected graphs (fixed $k \ge 1$). A structure $\mathcal{C}$ is said to be universal if every finite group is the automorphism group of some graph in $\mathcal{C}$. Each of the structures just mentioned is known to be universal - this means that there exists at least one graph in each of these structures whose automorphism group is isomorphic to the dihedral group $D_n$ of order $2n$.
You can also consider Cayley graphs of the group $D_n$. The automorphism group of a Cayley graph of $D_n$ contains a subgroup isomorphic to $D_n$.