On graphs having a V {minus 45 degree rule} { x } set as an identifying code

Abstract

We show that every nonstable graph (possibly infinite) with bounded degree admits a set V {minus 45 degree rule} { 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. © 2006.