Polynomial of a Graph


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) = ∑n i=γ(G) d(G, i)x , where d(G, i) is the number of dominating sets of G of size i, and γ(G) is the domination number of G. We obtain some properties of D(G, x) and its coefficients. Also we compute this polynomial for some specific graphs.

Extracted Key Phrases

Cite this paper

@inproceedings{Alikhani2009PolynomialOA, title={Polynomial of a Graph}, author={Saeid Alikhani}, year={2009} }