New results on variants of covering codes in Sierpinski graphs

Sylvain Gravier (1) , Matjaz Kovse (2) , Michel Mollard (1) , Julien Moncel (3) , Aline Parreau (1)

1 IF - Institut Fourier
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 LAAS-MOGISA

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.

Mots clés: Sierpinski graphs; total-domination; locating-dominating codes; identifying codes; codes in graphs

Domaines: Mathématique discrète [cs.DM]

Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau. New results on variants of covering codes in Sierpinski graphs. Designs, Codes and Cryptography, 2013, 69 (2), pp.181-188. ⟨hal-00656467⟩