On graphs having a image set as an identifying code Original Research Article

We show that every nonstable graph (possibly infinite) with bounded degree admits a set image as an identifying code. We know some infinite graphs for which only its vertex set itself is an identifying code, but these graphs have only vertices of infinite degree.