Vertex distinguishing colorings of graphs with Δ(G)=2 Original Research Article

Identifying codes are designed for locating faulty processors in multiprocessor systems. In this paper we consider a natural extension of this problem and introduce strongly identifying codes. Several lower bounds and constructions are given and relations between different types of identifying codes are examined.