加载中…
2012-01-05
New results on variants of covering codes in Sierpinski graphs
Sylvain GravierMatjaz KovseMichel MollardJulien MoncelAline Parreau
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本