Codes Identifying Vertices in Graphs

This talk deals with identifying codes in graphs. These codes we defined to model a problem of fault detection in multiprocessor systems. They are closely related to covering and superimposed codes. Very nice combinatorial questions arise from these codes, some of which we present during the talk.