[Home ] [Archive]    
:: Main :: Current Issue :: Archive :: Search :: Submit :: Contact ::
:: Volume 12, Issue 1 (4-2017) ::
IJMSI 2017, 12(1): 69-80 Back to browse issues page
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 >

DOI: DOI: 10.7508/ijmsi.2017.01.006

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
Volume 12, Issue 1 (4-2017) Back to browse issues page
نشریه علوم ریاضی و انفورماتیک Iranian Journal of Mathematical Sciences and Informatics
Persian site map - English site map - Created in 0.047 seconds with 786 queries by yektaweb 3535