Highly Influenced

# New Bounds for Codes Identifying Vertices in Graphs

@article{Cohen1999NewBF, title={New Bounds for Codes Identifying Vertices in Graphs}, author={G{\'e}rard D. Cohen and Iiro S. Honkala and Antoine Lobstein and Gilles Z{\'e}mor}, journal={Electr. J. Comb.}, year={1999}, volume={6} }

- Published 1999 in Electr. J. Comb.

Vertices in Graphs G erard Cohen cohen@inf.enst.fr Iiro Honkala honkala@utu.fi Antoine Lobstein lobstein@inf.enst.fr Gilles Z emor zemor@infres.enst.fr Abstract Let G = (V;E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v 2 V , the neighbouring set N(v; C) is the set of vertices of C at distance at most one from v. We say that the code C identi es the vertices of G if the neighbouring sets N(v; C); v 2 V; are all nonempty and di erent. What is… CONTINUE READING

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.

28 Extracted Citations

2 Extracted References

Similar Papers

#### Referenced Papers

##### Publications referenced by this paper.

Showing 1-2 of 2 references

Highly Influential