Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1220.05084
Alikhani, Saeid; Peng, Yee-hock
Dominating sets and domination polynomials of certain graphs. II. (English)
[J] Opusc. Math. 30, No. 1, 37-51 (2010). ISSN 1232-9274

Summary: The domination polynomial of a graph $G$ of order $n$ is the polynomial $$D(G, x)=\sum^n_{i=\gamma(G)} 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$.\par In this paper, we obtain some properties of the coefficients of $D(G,x)$. Also, by study of the dominating sets and the domination polynomials of specific graphs denoted by $G'(m)$, 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'(m)$, we study the dominating sets and domination polynomials of cycles and generalized theta graphs. Finally, we show that, if $n\equiv 2\pmod 3$ and $D(G,x)= D(C_n, x)$, then $G= C_n$.

MSC 2000:: *05C69 Dominating sets, independent sets, cliques
05C31
11B83 Special sequences of integers and polynomials

Keywords: domination polynomial; dominating set; cycle; theta graph

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]