{
  "id": "1409.0662",
  "version": "v1",
  "published": "2014-09-02T11:08:32.000Z",
  "updated": "2014-09-02T11:08:32.000Z",
  "title": "Locating-Dominating sets in Hypergraphs",
  "authors": [
    "Muhammad Fazil",
    "Imran Javaid",
    "Muhammad Salman",
    "Usman Ali"
  ],
  "comment": "12 pages, 0figure",
  "categories": [
    "math.CO"
  ],
  "abstract": "A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the location-domination number of hypergraphs in general and exact values with specified conditions are investigated. Moreover, locating-dominating sets in some specific hypergraphs are found.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-09-02T11:08:32.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C12",
      "05C65",
      "05C69"
    ],
    "keywords": [
      "locating-dominating sets",
      "exact values",
      "location-domination number",
      "sharp bounds",
      "specific hypergraphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1409.0662F"
    }
  }
}