{
  "id": "1305.5148",
  "version": "v5",
  "published": "2013-05-22T14:28:48.000Z",
  "updated": "2014-12-08T14:53:03.000Z",
  "title": "Identifying codes of Cartesian product of two cliques",
  "authors": [
    "Yingnan Zhang",
    "Min Feng",
    "Kaishun Wang"
  ],
  "comment": "This paper has been withdrawn by the authors. This result has been obtained by others",
  "categories": [
    "math.CO"
  ],
  "abstract": "An identifying code in a graph $G$ is a dominating set $C$ such that the closed neighborhood of each vertex in $G$ has a distinct intersection with $C$. 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.",
  "revisions": [
    {
      "version": "v4",
      "updated": "2013-12-19T14:27:03.000Z",
      "journal": null,
      "doi": null
    },
    {
      "version": "v5",
      "updated": "2014-12-08T14:53:03.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "cartesian product",
      "identifying code",
      "minimum cardinality",
      "distinct intersection",
      "nontrivial cliques"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1305.5148Z"
    }
  }
}