TY - JOUR
T1 - Some Families of Graphs whose Domination Polynomials are Unimodal
TT -
JF - IJMSI
JO - IJMSI
VL - 12
IS - 1
UR - http://ijmsi.ir/article-1-617-en.html
Y1 - 2017
SP - 69
EP - 80
KW - Domination polynomial
KW - unimodal
KW - family.
N2 - 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 present some families of graphs whose domination polynomials are unimodal.
M3 DOI: 10.7508/ijmsi.2017.01.006
ER -