N', a list, containing graphs in either Graph6 or Sparse6 format, modified as described below
N, a list, containing graphs, in the same format as the input, modified as described below
Description
The method creates a list of graphs, one for each vertex of the original graph G. The graph associated to a vertex v of G has the neighborhood of v complemented.