Geodesic
Identifying codes of Cartesian product of two cliques of the same size
The electronic journal of combinatorics, Tome 15 (2008)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
We determine the minimum cardinality of an identifying code of $K_n\square K_n$, the Cartesian product of two cliques of same size. Moreover we show that this code is unique, up to row and column permutations, when $n\geq 5$ is odd. If $n\geq 4$ is even, we exhibit two distinct optimal identifying codes.
DOI : 10.37236/879
Classification : 05C76, 05C69, 94B60, 94C12
Mots-clés : identifying code, clique product, Cartesian product 
S. Gravier; J. Moncel; A. Semri. Identifying codes of Cartesian product of two cliques of the same size. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/879
@article{10_37236_879,
     author = {S. Gravier and J. Moncel and A. Semri},
     title = {Identifying codes of {Cartesian} product of two cliques of the same size},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/879},
     zbl = {1180.05088},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/879/}
}
TY  - JOUR
AU  - S. Gravier
AU  - J. Moncel
AU  - A. Semri
TI  - Identifying codes of Cartesian product of two cliques of the same size
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/879/
DO  - 10.37236/879
ID  - 10_37236_879
ER  - 
%0 Journal Article
%A S. Gravier
%A J. Moncel
%A A. Semri
%T Identifying codes of Cartesian product of two cliques of the same size
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/879/
%R 10.37236/879
%F 10_37236_879

Cité par Sources :