Name
Abstract | ||
|---|---|---|
Consider a connected undirected graph G = (V, E), a subset of vertices C ⊆ V, and an integer r ≥ 1; for any vertex v ∈ V, let Br(v) denote the ball of radius r centered at v, i.e., the set of all vertices within distance r from v. If for all vertices v ∈ V (respectively, v ∈ V\C), the sets Br(v) ∩ C are all nonempty and different, then we call C an r-identifying code (respectively, an r-locating-dominating code). We study the smallest cardinalities or densities of these codes in chains (finite or infinite) and cycles. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ejc.2003.12.013 | Eur. J. Comb. |
Keywords | Field | DocType |
radius r,vertices c,smallest cardinalities,integer r,r-locating-dominating code,r-identifying code,distance r,connected undirected graph,vertices v,vertex v | Integer,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Cardinality,Mathematics | Journal |
Volume | Issue | ISSN |
25 | 7 | 0195-6698 |
Citations | PageRank | References |
53 | 2.74 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathalie Bertrand | 1 | 250 | 17.84 |
| Irène Charon | 2 | 599 | 53.16 |
| Olivier Hudry | 3 | 659 | 64.10 |
| Antoine Lobstein | 4 | 718 | 89.14 |