Some New Approaches for Computation of Domination Polynomial of Specific Graphs
Abstract
Let G = (V,E) be a simple graph. The domination polynomial
of G is the polynomial D(G, x) =
n
i=0 d(G, i)xi, 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
graphs.
of G is the polynomial D(G, x) =
n
i=0 d(G, i)xi, 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
graphs.
Keywords
Domination polynomial, graph with a handle, path
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.