Mathematics – Combinatorics
Scientific paper
2009-05-20
Mathematics
Combinatorics
13 pages
Scientific paper
Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x)=\sum_{i=\gamma(G)}^{n} d(G,i) x^{i}, where d(G,i) is the number of dominating sets of G of size i, and \gamma(G) is the domination number of G. In this paper we study the domination polynomials of cubic graphs of order 10. As a consequence, we show that the Petersen graph is determined uniquely by its domination polynomial.
Akbari Saieed
Alikhani Saeid
Peng Yee-hock
No associations
LandOfFree
The Domination Polynomials of Cubic graphs of order 10 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 The Domination Polynomials of Cubic graphs of order 10, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Domination Polynomials of Cubic graphs of order 10 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-242738