A note on graphs whose neighborhoods are n-cycles

Let G be a graph, and let v be a vertex of G. We denote by N(v) the set of vertices of G which are adjacent to v, and by 〈N(v)〉 the subgraph of G induced by N(v). We call 〈N(v)〉 the neighborhood of v. In a paper of 1968, Agakishieva has, as one of her main theorems, the statement: “Graphs in which every neighborhood is an n-cycle exist if and only if 3?n?6.” It it is the object of this note to provide a list of counter examples to this statement.