New results on variants of covering codes in Sierpinski graphs
  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. 
Sylvain Gravier (IF), Matjaz Kovse (LaBRI), Michel Mollard (IF),   Julien Moncel (LAAS), Aline Parreau (IF)
cs.DM