On cages admitting identifying codes

The problem of graphs admitting identifying codes is a recent topic. In this paper, we solve a question concerning the existence of ℓ -regular graphs admitting ( 1 , ≤ ℓ ) -identifying code. Moreover, our girth approach gives some improvements on the number of vertices of graphs which admit identifying codes.