{
  "id": "1103.3854",
  "version": "v1",
  "published": "2011-03-20T14:25:26.000Z",
  "updated": "2011-03-20T14:25:26.000Z",
  "title": "Domination Reliability",
  "authors": [
    "Klaus Dohmen",
    "Peter Tittmann"
  ],
  "comment": "14 pages",
  "categories": [
    "math.CO",
    "cs.DM",
    "math.PR"
  ],
  "abstract": "We propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage probability of a hypergraph. We derive explicit and recursive formulae for domination reliability and its associated domination reliability polynomial, deduce an analogue of Whitney's broken circuit theorem, and prove that computing domination reliability is NP-hard.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-03-20T14:25:26.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C30",
      "05C31",
      "62N05",
      "68M15",
      "90B25"
    ],
    "keywords": [
      "whitneys broken circuit theorem",
      "associated domination reliability polynomial",
      "network reliability measure",
      "coverage probability",
      "service networks"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1103.3854D"
    }
  }
}