General bounds for identifying codes in some infinite regular graphs.
Charon, Irène; Honkala, Iiro; Hudry, Olivier; Lobstein, Antoine
The Electronic Journal of Combinatorics [electronic only] (2001)
- Volume: 8, Issue: 1, page Research paper R39, 21 p.-Research paper R39, 21 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topCharon, Irène, et al. "General bounds for identifying codes in some infinite regular graphs.." The Electronic Journal of Combinatorics [electronic only] 8.1 (2001): Research paper R39, 21 p.-Research paper R39, 21 p.. <http://eudml.org/doc/121920>.
@article{Charon2001,
author = {Charon, Irène, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {-identifying code; infinite regular graphs; -identifying code},
language = {eng},
number = {1},
pages = {Research paper R39, 21 p.-Research paper R39, 21 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {General bounds for identifying codes in some infinite regular graphs.},
url = {http://eudml.org/doc/121920},
volume = {8},
year = {2001},
}
TY - JOUR
AU - Charon, Irène
AU - Honkala, Iiro
AU - Hudry, Olivier
AU - Lobstein, Antoine
TI - General bounds for identifying codes in some infinite regular graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2001
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 8
IS - 1
SP - Research paper R39, 21 p.
EP - Research paper R39, 21 p.
LA - eng
KW - -identifying code; infinite regular graphs; -identifying code
UR - http://eudml.org/doc/121920
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.