... Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, submitted.[4] I. Charon, O. Hudry, A. Lobstein: Identifying codes with small radius in some in nite regular ... Lobstein, G. Z´emor: New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics, vol. 6(1), R19, 1999.[7] G. Cohen, I. Honkala, A. Lobstein, G. Z´emor: Bounds for codes ... lower and upper bounds on the best possibledensity of r -identifying codes in three in nite regular graphs.1 IntroductionLet G =(V,E) be a connected undirected graph, finite or in nite; we define...