# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Dominating sets and domination polynomials of certain graphs. II. (English) Zbl 1220.05084

Summary: The domination polynomial of a graph $G$ of order $n$ is the polynomial

$D\left(G,x\right)=\sum _{i=\gamma \left(G\right)}^{n}d\left(G,i\right){x}^{i},$

where $d\left(G,i\right)$ is the number of dominating sets of $G$ of size $i$, and $\gamma \left(G\right)$ is the domination number of $G$.

In this paper, we obtain some properties of the coefficients of $D\left(G,x\right)$. Also, by study of the dominating sets and the domination polynomials of specific graphs denoted by ${G}^{\text{'}}\left(m\right)$, we obtain a relationship between the domination polynomial of graphs containing an induced path of length at least three, and the domination polynomial of related graphs obtained by replacing the path by shorter path. As examples of graphs ${G}^{\text{'}}\left(m\right)$, we study the dominating sets and domination polynomials of cycles and generalized theta graphs. Finally, we show that, if $n\equiv 2\phantom{\rule{4.44443pt}{0ex}}\left(mod\phantom{\rule{0.277778em}{0ex}}3\right)$ and $D\left(G,x\right)=D\left({C}_{n},x\right)$, then $G={C}_{n}$.

##### MSC:
 05C69 Dominating sets, independent sets, cliques 05C31 Graph polynomials 11B83 Special sequences of integers and polynomials
##### Keywords:
domination polynomial; dominating set; cycle; theta graph