... separates all the sets of at most vertices of G.Thededicated terminology [12] for such codes is (1, ≤ ) -identifying codes. ThesetsI(X)aresaid to be the identifying sets of the corresponding ... sets of at most vertices of G,andifalltheI(X, C)’s are nonempty then we say that C covers the sets of at most vertices of G.WesaythatC is a code identifying sets of at most vertices of G ... C. Smyth, Codes Identifying Sets of Vertices in Random Networks, submitted.[7] I. Honkala, T. Laihonen, S. Ranto, On Codes Identifying Sets of Vertices in HammingSpaces, Designs, Codes and...