Identifying codes of Cartesian product of two cliques
Combinatorics
2014-12-09 v5
Abstract
An identifying code in a graph is a dominating set such that the closed neighborhood of each vertex in has a distinct intersection with . In 2008, Gravier et al. determined the minimum cardinality of an identifying code of the Cartesian product of two cliques with the same size. In this note, we generalize this result to the Cartesian product of any two nontrivial cliques.
Cite
@article{arxiv.1305.5148,
title = {Identifying codes of Cartesian product of two cliques},
author = {Yingnan Zhang and Min Feng and Kaishun Wang},
journal= {arXiv preprint arXiv:1305.5148},
year = {2014}
}
Comments
This paper has been withdrawn by the authors. This result has been obtained by others