Some New Approaches for Computation of Domination Polynomial of Specific Graphs

Authors

  • Saeid Alikhani
  • Eisa Mahmoudi
  • Mohammad Reza Oboudi

DOI:

https://doi.org/10.30495/jme.v8i0.311

Keywords:

Domination polynomial, graph with a handle, path

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.

Downloads

Published

2014-09-20

Issue

Section

Vol. 8, No. 2, (2014)