Domination Polynomial of Generalized Book Graphs

Let g be a simple graph of order n. the domination polynomial of g is the polynomial d(g, x) = sigma ^n_ i=0 d(g, i)xi , where d(g, i) is the number of dominating sets of g of size i. let n be any positive integer and bn be the n-book graphs, formed by joining n copies of the cycle graph c4 with a common edge. in this paper, we study the domination polynomials of some generalized book graphs. in particular we examine the domination roots of these families, and find the limiting curve for the roots.