A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid.
Cranston, Daniel W.; Yu, Gexin
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper R113, 16 p.-Research Paper R113, 16 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topCranston, Daniel W., and Yu, Gexin. "A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R113, 16 p.-Research Paper R113, 16 p.. <http://eudml.org/doc/230892>.
@article{Cranston2009,
author = {Cranston, Daniel W., Yu, Gexin},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper R113, 16 p.-Research Paper R113, 16 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid.},
url = {http://eudml.org/doc/230892},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Cranston, Daniel W.
AU - Yu, Gexin
TI - A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R113, 16 p.
EP - Research Paper R113, 16 p.
LA - eng
UR - http://eudml.org/doc/230892
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.