On the graphs with four distinct domination roots
Saeid Alikhani · International Journal of Computer Mathematics · 2011
The domination polynomial of a graph G of order n is the polynomial , where d(G, i) is the number of dominating vertex sets of G with cardinality i. A root of D(G, x) is called a domination root of G. In this paper, we characterize graphs with exactly four distinct domination roots .