1 problem

For integers $n$ and $k$ with $k\leq n/2$, let $\operatorname{Circ}(n,k)$ denote the circulant graph with these parameters. A graph is a prime distance graph if its vertices can be…