New bounds for codes identifying vertices in graphs.
Cohen, Gérard; Honkala, Iiro; Lobstein, Antoine; Zémor, Gilles
The Electronic Journal of Combinatorics [electronic only] (1999)
- Volume: 6, Issue: 1, page Research paper R19, 14 p.-Research paper R19, 14 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topCohen, Gérard, et al. "New bounds for codes identifying vertices in graphs.." The Electronic Journal of Combinatorics [electronic only] 6.1 (1999): Research paper R19, 14 p.-Research paper R19, 14 p.. <http://eudml.org/doc/119827>.
@article{Cohen1999,
author = {Cohen, Gérard, Honkala, Iiro, Lobstein, Antoine, Zémor, Gilles},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {code; infinite graph},
language = {eng},
number = {1},
pages = {Research paper R19, 14 p.-Research paper R19, 14 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {New bounds for codes identifying vertices in graphs.},
url = {http://eudml.org/doc/119827},
volume = {6},
year = {1999},
}
TY - JOUR
AU - Cohen, Gérard
AU - Honkala, Iiro
AU - Lobstein, Antoine
AU - Zémor, Gilles
TI - New bounds for codes identifying vertices in graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1999
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 6
IS - 1
SP - Research paper R19, 14 p.
EP - Research paper R19, 14 p.
LA - eng
KW - code; infinite graph
UR - http://eudml.org/doc/119827
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.