  Let G be a simple graph of order n. The domination polynomial is the
generating polynomial for the number of dominating sets of G of each
cardinality. A root of this polynomial is called a domination root of G.
Obviously 0 is a domination root of every graph G. In the study of the
domination roots of graphs, this naturally raises the question: which graphs
have no nonzero real domination roots? In this paper we present some families
of graphs whose have this property.
