Dense Graphs with Cycle Neighborhoods

For all ϵ > 0, we construct graphs with n vertices and > n2 − ϵ edges, for arbitrarily large n, such that the neighborhood of each vertex is a cycle. This result is asymptotically best possible.