Some New Approaches for Computation of Domination Polynomial of Specific Graphs
. Let G = (V, E) be a simple graph. The domination polynomial of G is the polynomial D(G, x) = Pn i=0 d(G, i)x i , where d(G, i) is the number of dominating sets of G of size i. In this paper, we present some new approaches for computation of domination polynomial of specific graph
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Islamic Azad University
2014-06-01
|
| Series: | Journal of Mathematical Extension |
| Online Access: | http://ijmex.com/index.php/ijmex/article/view/311/160 |