On robust and dynamic identifying codes

A subset C of vertices in an undirected graph G=(V,E) is called a 1-identifying code if the sets I(v)={u∈C:d(u,v)≤1}, v∈V, are nonempty and no two of them are the same set. It is natural to consider classes of codes that retain the identification property under various conditions, e.g., when the sets I(v) are possibly slightly corrupted. We consider two such classes of robust codes. We also consider dynamic identifying codes, i.e., walks in G whose vertices form an identifying code in G.