An optimal strongly identifying code in the infinite triangular grid.
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper R91, 10 p., electronic only-Research Paper R91, 10 p., electronic only
- ISSN: 1077-8926
Access Full Article
topHow to cite
topHonkala, Iiro. "An optimal strongly identifying code in the infinite triangular grid.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper R91, 10 p., electronic only-Research Paper R91, 10 p., electronic only. <http://eudml.org/doc/231681>.
@article{Honkala2010,
author = {Honkala, Iiro},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {graph; identifying code; triangular grid; density},
language = {eng},
number = {1},
pages = {Research Paper R91, 10 p., electronic only-Research Paper R91, 10 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {An optimal strongly identifying code in the infinite triangular grid.},
url = {http://eudml.org/doc/231681},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Honkala, Iiro
TI - An optimal strongly identifying code in the infinite triangular grid.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2010
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 17
IS - 1
SP - Research Paper R91, 10 p., electronic only
EP - Research Paper R91, 10 p., electronic only
LA - eng
KW - graph; identifying code; triangular grid; density
UR - http://eudml.org/doc/231681
ER -
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.