AbstractAssume that G=(V,E) is an undirected graph, and C⊆V. For every v∈V, we denote by I(v) the set of all elements of C that are within distance one from v. If all the sets I(v) for v∈V⧹C are non-empty, and pairwise different, then C is called a locating-dominating set. The smallest possible density of a locating-dominating set in the infinite triangular grid is shown to be 1357
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r⩾1;...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or i...
AbstractAssume that G=(V,E) is an undirected graph, and C⊆V. For every v∈V, we denote by I(v) the se...
Abstract. An open-locating-dominating set (OLD-set) is a subset of vertices of a graph such that eve...
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjace...
Assume that G = (V, E) is an undirected graph, and C subset of V. For every v is an element of V, we...
The motivation to study location-domination comes from findingobjects in sensor networks. In this pa...
A locating-dominating set of an undirected graph is a subset of vertices S such that S is dominating...
AbstractDetermining a malfunctioning component in a processor network gives the motivation for locat...
An Open Locating Dominating set is a subset of vertices of a graph such that (i) every vertex in the...
Bertrand, Charon, Hudry and Lobstein studied, in their paper in 2004 [1] r-locating-dominating codes...
We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set $S$ of ...
The smallest cardinality of an r-locating-dominating code in a cycle C_n of length n is denoted by M...
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent ...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r⩾1;...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or i...
AbstractAssume that G=(V,E) is an undirected graph, and C⊆V. For every v∈V, we denote by I(v) the se...
Abstract. An open-locating-dominating set (OLD-set) is a subset of vertices of a graph such that eve...
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjace...
Assume that G = (V, E) is an undirected graph, and C subset of V. For every v is an element of V, we...
The motivation to study location-domination comes from findingobjects in sensor networks. In this pa...
A locating-dominating set of an undirected graph is a subset of vertices S such that S is dominating...
AbstractDetermining a malfunctioning component in a processor network gives the motivation for locat...
An Open Locating Dominating set is a subset of vertices of a graph such that (i) every vertex in the...
Bertrand, Charon, Hudry and Lobstein studied, in their paper in 2004 [1] r-locating-dominating codes...
We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set $S$ of ...
The smallest cardinality of an r-locating-dominating code in a cycle C_n of length n is denoted by M...
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent ...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r⩾1;...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or i...
DOI
Add to ORKG