Geodesic
Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 1.

Voir la notice de l'article provenant de la source Episciences

Graph Theory
DOI : 10.46298/dmtcs.2107
Classification : 05C70 
@article{DMTCS_2015_17_1_a6,
     author = {Pelto, Mikko},
     title = {Maximum difference about the size of optimal identifying codes in graphs differing by one vertex},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {17},
     number = {1},
     year = {2015-2016},
     doi = {10.46298/dmtcs.2107},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2107/}
}
TY  - JOUR
AU  - Pelto, Mikko
TI  - Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
JO  - Discrete mathematics & theoretical computer science
PY  - 2015-2016
VL  - 17
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2107/
DO  - 10.46298/dmtcs.2107
LA  - en
ID  - DMTCS_2015_17_1_a6
ER  - 
%0 Journal Article
%A Pelto, Mikko
%T Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
%J Discrete mathematics & theoretical computer science
%D 2015-2016
%V 17
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2107/
%R 10.46298/dmtcs.2107
%G en
%F DMTCS_2015_17_1_a6
Pelto, Mikko. Maximum difference about the size of optimal identifying codes in graphs differing by one vertex. Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 1. doi : 10.46298/dmtcs.2107. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2107/

Cité par Sources :