On graphs having a V\{x} set as an identifying code

We show that every nonstable graph (possibly infinite) with bounded degree admits a set [email protected]?{x} 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.