On the domination polynomial of some graph operations (Q361577)

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.