Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau
In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpinski graphs. We compute the minimum size of such codes in Sierpinski graphs.