New results on variants of covering codes in Sierpinski graphs
arXiv:1201.1202
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.