Add to ORKGInternational audienceLocating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the dominating set. In this paper, we study the size of a smallest locating-dominating set or identifying code for graphs of girth at least 5 and of given minimum degree. We use the technique of vertex-disjoint paths to provide upper bounds on the minimum size of such sets, and construct graphs who come close to meet these bounds
International audienceThe problems of determining the minimum-sized identifying, locating-dominating...
In an undirected graph G, a subset C ⊆ V (G) such that C is a dominating set of G, and each vertex i...
The problems of determining the minimum-size identifying, locating-dominating and open locating-domi...
Locating-dominating sets and identifying codes are two closely related notions in the area of separa...
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertice...
AbstractLet G=(V,E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V (res...
AbstractAn identifying code of a graph G is a dominating set C such that every vertex x of G is dist...
An identifying code is a subset of vertices of a graph with the property that each vertex is uniquel...
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertice...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
An identifying code is a subset of vertices of a graph with the property that each vertex is uniquel...
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertice...
International audienceThe problems of determining minimum identifying, locating-dominating, open loc...
International audienceThe problems of determining minimum identifying, locating-dominating, open loc...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
International audienceThe problems of determining the minimum-sized identifying, locating-dominating...
In an undirected graph G, a subset C ⊆ V (G) such that C is a dominating set of G, and each vertex i...
The problems of determining the minimum-size identifying, locating-dominating and open locating-domi...
Locating-dominating sets and identifying codes are two closely related notions in the area of separa...
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertice...
AbstractLet G=(V,E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V (res...
AbstractAn identifying code of a graph G is a dominating set C such that every vertex x of G is dist...
An identifying code is a subset of vertices of a graph with the property that each vertex is uniquel...
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertice...
AbstractIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each ver...
An identifying code is a subset of vertices of a graph with the property that each vertex is uniquel...
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertice...
International audienceThe problems of determining minimum identifying, locating-dominating, open loc...
International audienceThe problems of determining minimum identifying, locating-dominating, open loc...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
International audienceThe problems of determining the minimum-sized identifying, locating-dominating...
In an undirected graph G, a subset C ⊆ V (G) such that C is a dominating set of G, and each vertex i...
The problems of determining the minimum-size identifying, locating-dominating and open locating-domi...