New results on variants of covering codes in Sierpinski graphs

Aline Parreau (IF); Julien Moncel (LAAS); Matjaz Kovse (LaBRI); Michel Mollard (IF); Sylvain Gravier (IF)

arxiv: 1201.1202 · v1 · pith:ZAY774M5new · submitted 2012-01-05 · 💻 cs.DM

New results on variants of covering codes in Sierpinski graphs

Sylvain Gravier (IF) , Matjaz Kovse (LaBRI) , Michel Mollard (IF) , Julien Moncel (LAAS) , Aline Parreau (IF) This is my paper

classification 💻 cs.DM

keywords codesgraphssierpinskicomputecoveringidentifyinglocating-dominatingminimum

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.

New results on variants of covering codes in Sierpinski graphs

discussion (0)