Introduction to Domination Polynomial of a Graph

Details Introduction to Domination Polynomial of a Graph Introduction to Domination Polynomial of a Graph

2009-05-14

arxiv.org/abs/0905.2251v1

Mathematics

Combinatorics

10 pages. Accepted http://www.combinatorialmath.ca/ArsCombinatoria/index.html

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Introduction to Domination Polynomial of a Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Introduction to Domination Polynomial of a Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Introduction to Domination Polynomial of a Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-399839