Constructing self-complementary regular graphs

It can be easily shown that if a graph is self-complementary and regular then the number of vertices, $n$, is equal to $4k +1$ for some $k \in \mathbb{Z}$.

But, how to we prove (prove by constructing) that there is a self-complementary regular graph for $n = 4k +1$