40 citations · 43 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2012
New results on variants of covering codes in Sierpinski graphs
Sylvain Gravier, Matjaz Kovse, Michel Mollard +2
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…
cs.DM2010★ 40 cited
Extremal graphs for the identifying code problem
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse +3
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at mo…