Lower Bounds for Identifying Codes in some Infinite Grids
نویسندگان
چکیده
An r-identifying code on a graph G is a set C ⊂ V (G) such that for every vertex in V (G), the intersection of the radius-r closed neighborhood with C is nonempty and unique. On a finite graph, the density of a code is |C|/|V (G)|, which naturally extends to a definition of density in certain infinite graphs which are locally finite. We present new lower bounds for densities of codes for some small values of r in both the square and hexagonal grids.
منابع مشابه
On Vertex Identifying Codes For Infinite Lattices
An r-identifying code on a graph G is a set C ⊂ V (G) such that for every vertex in V (G), the intersection of the radius-r closed neighborhood with C is nonempty and unique. On a finite graph, the density of a code is |C|/|V (G)|, which naturally extends to a definition of density in certain infinite graphs which are locally finite. We present new lower bounds for densities of codes for some s...
متن کاملAutomated Discharging Arguments for Density Problems in Grids
Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an identifying code in the hexagonal grid remains open, with an upper bound of 37 ≈ 0.428571 and a lower bound of 5 12 ≈ 0.416666. We present a new, experimental fram...
متن کاملGeneral Bounds for Identifying Codes in Some Infinite Regular Graphs
Consider a connected undirected graph G = (V,E) and a subset of vertices C. If for all vertices v ∈ V , the sets Br(v) ∩ C are all nonempty and pairwise distinct, where Br(v) denotes the set of all points within distance r from v, then we call C an r-identifying code. We give general lower and upper bounds on the best possible density of r-identifying codes in three infinite regular graphs.
متن کاملOptimal bounds on codes for location in circulant graphs
Identifying and locating-dominating codes have been studied widely in circulant graphs of type Cn(1, 2, 3, . . . , r) over the recent years. In 2013, Ghebleh and Niepel studied locatingdominating and identifying codes in the circulant graphs Cn(1, d) for d = 3 and proposed as an open question the case of d > 3. In this paper we study identifying, locating-dominating and self-identifying codes i...
متن کاملA New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Given a graph G, an identifying code D ⊆ V (G) is a vertex set such that for any two distinct vertices v1, v2 ∈ V (G), the sets N [v1] ∩ D and N [v2] ∩ D are distinct and nonempty (here N [v] denotes a vertex v and its neighbors). We study the case when G is the infinite hexagonal grid H. Cohen et.al. constructed two identifying codes for H with density 3/7 and proved that any identifying code ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010