Bounds for codes identifying vertices in the hexagonal grid (Q2706181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1578814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds for codes identifying vertices in the hexagonal grid |
scientific article; zbMATH DE number 1578814 |
Statements
19 March 2001
0 references
hexagonal grid
0 references
identifying code
0 references
density
0 references
nonempty and different from
0 references
Bounds for codes identifying vertices in the hexagonal grid (English)
0 references
In an undirected graph \(G=(V,E)\), a subset \(C\) of \(V\) is called an identifying code of the sets \(B_1(v)\cap C\) consisting of all elements of \(C\) within distance one from the vertex \(v\) if these sets are nonempty and different. The authors take as \(G\) the infinite hexagonal grid graph and show that the density of any identifying code is at least \(16/39\) and that there is an identifying code of density \(3/7\).
0 references
0.936221182346344
0 references
0.9342487454414368
0 references
0.9148390889167786
0 references
0.904453694820404
0 references
0.9043479561805724
0 references
