Introduction to Domination Polynomial of a Graph
Combinatorics
2009-05-15 v1
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.
Cite
@article{arxiv.0905.2251,
title = {Introduction to Domination Polynomial of a Graph},
author = {Saeid Alikhani and Yee-hock Peng},
journal= {arXiv preprint arXiv:0905.2251},
year = {2009}
}
Comments
10 pages. Accepted http://www.combinatorialmath.ca/ArsCombinatoria/index.html