{
  "id": "1312.0772",
  "version": "v1",
  "published": "2013-12-03T11:23:46.000Z",
  "updated": "2013-12-03T11:23:46.000Z",
  "title": "On global location-domination in graphs",
  "authors": [
    "C. Hernando",
    "M. Mora",
    "I. M. Pelayo"
  ],
  "comment": "15 pages: 2 tables; 8 figures; 20 references",
  "categories": [
    "math.CO"
  ],
  "abstract": "A dominating set $S$ of a graph $G$ is called locating-dominating, LD-set for short, if every vertex $v$ not in $S$ is uniquely determined by the set of neighbors of $v$ belonging to $S$. Locating-dominating sets of minimum cardinality are called $LD$-codes and the cardinality of an LD-code is the location-domination number $\\lambda(G)$. An LD-set $S$ of a graph $G$ is global if it is an LD-set of both $G$ and its complement $\\overline{G}$. The global location-domination number $\\lambda_g(G)$ is the minimum cardinality of a global LD-set of $G$. In this work, we give some relations between locating-dominating sets and the location-domination number in a graph and its complement.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-12-03T11:23:46.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C35"
    ],
    "keywords": [
      "minimum cardinality",
      "locating-dominating sets",
      "global location-domination number",
      "global ld-set",
      "complement"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1312.0772H"
    }
  }
}