Add to ORKGThe motivation to study location-domination comes from findingobjects in sensor networks. In this paper, we considerlocation-domination of both single vertices and sets of vertices incycles and paths. In many cases, optimal codes, i.e. codes with thesmallest cardinalities, are found
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...
The smallest cardinality of an r-locating-dominating code in a cycle C_n of length n is denoted by M...
Bertrand, Charon, Hudry and Lobstein studied, in their paper in 2004 [1] r-locating-dominating codes...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
Locating-dominating codes in a graph find their application in sensor networks and have been studied...
Identifying codes and locating-dominating codes have been designed for locating irregularities in se...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r⩾1;...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...
Identifying and locating-dominating codes have been widely studied in circulant graphs of type Cn(1,...
AbstractAssume that G=(V,E) is an undirected graph, and C⊆V. For every v∈V, we denote by I(v) the se...
A dominating set S of a graph G is called locating-dominating , LD-set for short, if every vertex v ...
AbstractFor facilities safeguards problems in which one is interested in detecting the presence of, ...
Locating-dominating sets and identifying codes are two closely related notions in the area of separa...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...
The smallest cardinality of an r-locating-dominating code in a cycle C_n of length n is denoted by M...
Bertrand, Charon, Hudry and Lobstein studied, in their paper in 2004 [1] r-locating-dominating codes...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
Locating-dominating codes in a graph find their application in sensor networks and have been studied...
Identifying codes and locating-dominating codes have been designed for locating irregularities in se...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r⩾1;...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...
Identifying and locating-dominating codes have been widely studied in circulant graphs of type Cn(1,...
AbstractAssume that G=(V,E) is an undirected graph, and C⊆V. For every v∈V, we denote by I(v) the se...
A dominating set S of a graph G is called locating-dominating , LD-set for short, if every vertex v ...
AbstractFor facilities safeguards problems in which one is interested in detecting the presence of, ...
Locating-dominating sets and identifying codes are two closely related notions in the area of separa...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v n...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...