دوره 12، شماره 1 - ( 1-1396 )
جلد 12 شماره 1 صفحات 80-69 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
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-fa.html
URL: http://ijmsi.ir/article-1-617-fa.html
Some Families of Graphs whose Domination Polynomials are Unimodal. مجله علوم ریاضی و انفورماتیک. 1396; 12 (1) :69-80
چکیده:
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.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
