Some Families of Graphs whose Domination Polynomials are Unimodal

Author(s):
Abstract:
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.
Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:12 Issue: 1, May 2017
Pages:
69 to 80
https://www.magiran.com/p1674665  
مقالات دیگری از این نویسنده (گان)