{
  "id": "2008.00236",
  "version": "v1",
  "published": "2020-08-01T10:40:40.000Z",
  "updated": "2020-08-01T10:40:40.000Z",
  "title": "Double domination in lexicographic product graphs",
  "authors": [
    "A. Cabrera Martinez",
    "S. Cabrera Garcia",
    "J. A. Rodriguez-Velazquez"
  ],
  "journal": "Discrete Applied Mathematics 284 (2020) 290-300",
  "doi": "10.1016/j.dam.2020.03.045",
  "categories": [
    "math.CO"
  ],
  "abstract": "In a graph $G$, a vertex dominates itself and its neighbours. A subset $S\\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The minimum cardinality among all double dominating sets of $G$ is the double domination number. In this article, we obtain tight bounds and closed formulas for the double domination number of lexicographic product graphs $G\\circ H$ in terms of invariants of the factor graphs $G$ and $H$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-08-01T10:40:40.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C69",
      "05C76"
    ],
    "keywords": [
      "lexicographic product graphs",
      "double domination number",
      "double dominating set",
      "factor graphs",
      "vertex dominates"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "Elsevier"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}