Optimal error-detecting open-locating-dominating set on the infinite triangular grid
نویسندگان
چکیده
منابع مشابه
Optimal open-locating-dominating sets in infinite triangular grids
An open-locating-dominating set (OLD-set) is a subset of vertices of a graph such that every vertex in the graph has at least one neighbor in the set and no two vertices in the graph have the same set of neighbors in the set. This is an analogue to the well-studied identifying code in the literature. In this paper, we prove that the optimal density of the OLD-set for the infinite triangular gri...
متن کاملOn locating-dominating codes for locating large numbers of vertices in the infinite king grid
Assume that G = (V, E) is an undirected graph with vertex set V and edge set E. The ball Br(v) denotes the vertices within graphical distance r from v. A subset C ⊆ V is called an (r,≤ l)-locating-dominating code of type B if the sets Ir(F ) = ⋃ v∈F (Br(v)∩C) are distinct for all subsets F ⊆ V \C with at most l vertices. A subset C ⊆ V is an (r,≤ l)-locatingdominating code of type A if sets Ir(...
متن کاملOpen neighborhood locating dominating sets
For a graph G that models a facility, various detection devices can be placed at the vertices so as to identify the location of an intruder such as a thief or saboteur. Here we introduce the open neighborhood locating-dominating set problem. We seek a minimum cardinality vertex set S with the property that for each vertex v its open neighborhood N(v) has a unique non-empty intersection with S. ...
متن کاملAn Optimal Strongly Identifying Code in the Infinite Triangular Grid
Assume 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 the sets I(v) \ {v} for v ∈ V are all nonempty, and, moreover, the sets {I(v), I(v) \ {v}} for v ∈ V are disjoint, then C is called a strongly identifying code. The smallest possible density of a strongly identifying code in the infin...
متن کاملOptimal locating-total dominating sets in strips of height 3
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V \ C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2374