دوره 12، شماره 1 - ( 1-1396 )                   جلد 12 شماره 1 صفحات 69-80 | برگشت به فهرست نسخه ها

DOI: DOI: 10.7508/ijmsi.2017.01.006


XML Print


چکیده:  

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.

نوع مطالعه: پژوهشي | موضوع مقاله: عمومى