43 citations · 237 across the 31 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DM2010★ 9 cited
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
Florent Foucaud, Reza Naserasr, Aline Parreau
An identifying code of a (di)graph is a dominating subset of the vertices of such that all distinct vertices of have distinct (in)neighbourhoods within . In this…
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…