[Home ]      
:: Main :: Current Issue :: Archive :: Search :: Submit :: Contact ::
:: Volume 12, Number 1 (4-2017) ::
Back to browse issues page IJMSI 2017, 12(1): 69-80
Some Families of Graphs whose Domination Polynomials are Unimodal
S. Alikhani , S. Jahari

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.

Keywords: Domination polynomial, unimodal, family.
Full-Text [PDF 311 kb]      
Type of Study: Research | Subject: General
Add your comments about this article
Your username or email:

Write the security code in the box >

XML     Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Alikhani S, Jahari S. Some Families of Graphs whose Domination Polynomials are Unimodal. IJMSI. 2017; 12 (1) :69-80
URL: http://ijmsi.ir/article-1-617-en.html
Back to browse issues page Volume 12, Number 1 (4-2017)
نشریه علوم ریاضی و انفورماتیک Iranian Journal of Mathematical Sciences and Informatics
Persian site map - English site map - Created in 0.043 seconds with 781 queries by yektaweb 3318