2000 character limit reached
New results on variants of covering codes in Sierpinski graphs (1201.1202v1)
Published 5 Jan 2012 in cs.DM
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.