Sciweavers

CORR
2010
Springer

Extremal graphs for the identifying code problem

13 years 3 months ago
Extremal graphs for the identifying code problem
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 most 1 from x. The problem of nding an identifying code of minimum possible size turned out to be a challenging problem. It was proved by N. Bertrand that if a graph on n vertices with at least one edge admits an identifying code, then a minimum
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse,
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
Comments (0)