Domination polynomial of generalized friendship and generalized book graphs

Abstract

Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining n copies of the cycle graph of order 4 with a common edge and 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.

16 pages, 11 figures. arXiv admin note: substantial text overlap with arXiv:1401.2092