On the domination polynomial of some graph operations (Q361577)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the domination polynomial of some graph operations |
scientific article |
Statements
On the domination polynomial of some graph operations (English)
0 references
29 August 2013
0 references
Summary: Let \(G\) be a simple graph of order \(n\). The domination polynomial of \(G\) is the polynomial \(D(G, \lambda) = \sum^n_{i = 0} d(G, i) \lambda^i\), where \(d(G, i)\) is the number of dominating sets of \(G\) of size \(i\). Every root of \(D(G, \lambda)\) is called the domination root of \(G\). In this paper, we study the domination polynomial of some graph operations.
0 references
domination root
0 references
dominating sets
0 references