New results on variants of covering codes in Sierpinski graphs
Discrete Mathematics
2012-01-06 v1
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.
Keywords
Cite
@article{arxiv.1201.1202,
title = {New results on variants of covering codes in Sierpinski graphs},
author = {Sylvain Gravier and Matjaz Kovse and Michel Mollard and Julien Moncel and Aline Parreau},
journal= {arXiv preprint arXiv:1201.1202},
year = {2012}
}