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.

objective(s): pei based nanoparticle (np) due to dual capabilities of proton sponge and dna binding is known as powerful tool for nucleic acid delivery to cells. however, serious cytotoxicity and complicated conditions, which govern nps properties and its interactions with cells practically, hindered achievement to high transfection efficiency. here, we have tried to optimize the properties of ...

a graceful labeling of a graph g of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of g, such that when each edge of g has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. if a graceful labeling f of a bipartite graph g assigns the smaller labels to one of the two stable sets of g, then f...

introduction: in the present study, the effects of oral morphine consumption in pregnant female rats on the amygdaloid complex development in the embryos were investigated. methods: female wistar rats weighing 250-300 g (n=15) were divided into control (n = 8) and experimental groups (n = 7). the experimental group received morphine (0.05 mg/ml) in their tap water. on the 19th day of pregnancy,...