{
  "id": "0905.2251",
  "version": "v1",
  "published": "2009-05-14T05:01:11.000Z",
  "updated": "2009-05-14T05:01:11.000Z",
  "title": "Introduction to Domination Polynomial of a Graph",
  "authors": [
    "Saeid Alikhani",
    "Yee-hock Peng"
  ],
  "comment": "10 pages. Accepted http://www.combinatorialmath.ca/ArsCombinatoria/index.html",
  "categories": [
    "math.CO"
  ],
  "abstract": "We introduce a domination polynomial of a graph G. The domination polynomial of a graph G of order n is the polynomial D(G, x) =\\sum_{i=1}^n d(G, i)x^i, where d(G, i) is the number of dominating sets of G of size i. We obtain some properties of D(G, x) and its coefficients. Also we compute this polynomial for some specific graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-05-14T05:01:11.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C69",
      "11B83"
    ],
    "keywords": [
      "domination polynomial",
      "introduction",
      "specific graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0905.2251A"
    }
  }
}