{
  "id": "2311.06490",
  "version": "v1",
  "published": "2023-11-11T06:13:10.000Z",
  "updated": "2023-11-11T06:13:10.000Z",
  "title": "Integer Programming Formulations and Probabilistic Bounds for Some Domination Parameters",
  "authors": [
    "Mhelmar A. Labendia",
    "Clifford R. Pornia"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we further study the concepts of hop domination and 2-step domination and introduce the concepts of restrained hop domination, total restrained hop domination, 2-step restrained domination, and total 2-step restrained domination in graphs. We then construct integer programming formulations and present probabilistic upper bounds for these domination parameters.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-11-11T06:13:10.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "domination parameters",
      "probabilistic bounds",
      "restrained domination",
      "probabilistic upper bounds",
      "total restrained hop domination"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}