{
  "id": "1511.08086",
  "version": "v1",
  "published": "2015-11-25T15:24:07.000Z",
  "updated": "2015-11-25T15:24:07.000Z",
  "title": "Domination polynomial of lexicographic product of specific graphs",
  "authors": [
    "Saeid Alikhani",
    "Somayeh Jahari"
  ],
  "comment": "7 pages, 2 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G,\\lambda)=\\sum_{i=0}^{n} d(G,i) \\lambda^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. We consider the lexicographic product of two specific graphs and study their domination polynomials.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-11-25T15:24:07.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C60"
    ],
    "keywords": [
      "domination polynomial",
      "lexicographic product",
      "specific graphs",
      "simple graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv151108086A"
    }
  }
}